login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A214041 a(n)=a(n-1)+floor((a(n-2)+a(n-3))/2), with a(n)=1 for n<3. 2
1, 1, 1, 2, 3, 4, 6, 9, 14, 21, 32, 49, 75, 115, 177, 272, 418, 642, 987, 1517, 2331, 3583, 5507, 8464, 13009, 19994, 30730, 47231, 72593, 111573, 171485, 263568, 405097, 622623, 956955, 1470815, 2260604, 3474489, 5340198, 8207744, 12615087, 19389058 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,4

COMMENTS

a(n)=A022875(n) for 1<n<15.

LINKS

Harvey P. Dale, Table of n, a(n) for n = 0..1000

MATHEMATICA

nxt[{a_, b_, c_}]:={b, c, c+Floor[(a+b)/2]}; NestList[nxt, {1, 1, 1}, 50][[All, 1]] (* Harvey P. Dale, Jun 14 2020 *)

PROG

(Python)

ppp=prpr=prev=1

for n in range(65):

    cur=prev+(prpr+ppp)/2

    print str(ppp)+', ',

    ppp, prpr, prev = prpr, prev, cur

CROSSREFS

Cf. A022875, A214039, A214040.

Sequence in context: A143951 A328262 A292800 * A058355 A179041 A099558

Adjacent sequences:  A214038 A214039 A214040 * A214042 A214043 A214044

KEYWORD

nonn

AUTHOR

Alex Ratushnyak, Jul 01 2012

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 23 17:29 EDT 2020. Contains 337969 sequences. (Running on oeis4.)