Complete the recursive formula of the arithmetic sequence 4, 22, 40,
b(1) =
b(n) = b(n - 18+

ranks (& how to earn them):

-beginner (needs at least 0 points & 0 brainliest answers)

- hand (needs at least 100 points & 0 brainliest answers)

-ambitious   (needs at least 250 points & 0 brainliest answers)

-virtuoso (needs at least 500 points & 5 brainliest answers)

-expert   (needs at least 1,000 points & 10 brainliest answers)

-ace (needs at least 3,000 points & 15 brainliest answers)

-genius   (needs at least 15,000 points & 50 brainliest answers)

how to award brainliest:

you must wait until 2 people answer to award brainliest. i'm pretty sure that it should be next to the "" and "comments" buttons.  

answer: (yeees, you need a poet.)

//blooming serenity//

beautiful in the morning

mysterious at night

wonderous nature souring

with all it's mystical might

the flower that blooms

to the fox that looms

nocturnal creatures

with various features

a blooming flower soon in sight

as a new little hatchling fears to take flight  

afraid to leave it's calming nest,

but dear little bird, mother knows best

as sure as there are stars in the sky,

life is not about who, where what, when or why-

it's the journey that follows

adventures we swallow

of   nature's deep wonders,

natural disasters and storm's thunders.

blooming serenity

life and nature, truly is heavenly.

-kerstien lehman

step-by-step explanation: