The OEIS is supported by the many generous donors to the OEIS Foundation.

 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

%I #14 May 21 2021 17:47:09

%S 1,1,1,2,3,4,6,9,14,21,32,49,75,115,177,272,418,642,987,1517,2331,

%T 3583,5507,8464,13009,19994,30730,47231,72593,111573,171485,263568,

%U 405097,622623,956955,1470815,2260604,3474489,5340198,8207744,12615087,19389058

%N a(n) = a(n-1) + floor((a(n-2) + a(n-3))/2), with a(n)=1 for n < 3.

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

%H Harvey P. Dale, <a href="/A214041/b214041.txt">Table of n, a(n) for n = 0..1000</a>

%t 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 *)

%o (Python)

%o ppp=prpr=prev=1

%o for n in range(65):

%o cur=prev+(prpr+ppp)//2

%o print(str(ppp), end=',')

%o ppp,prpr,prev = prpr,prev,cur

%Y Cf. A022875, A214039, A214040.

%K nonn

%O 0,4

%A _Alex Ratushnyak_, Jul 01 2012

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

Last modified April 17 17:01 EDT 2024. Contains 371765 sequences. (Running on oeis4.)