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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A214040 a(n)=a(n-1)+floor((a(n-2)+a(n-3))/2), with a(n)=n for n<3. 1

%I #10 Aug 25 2014 10:20:48

%S 0,1,2,2,3,5,7,11,17,26,40,61,94,144,221,340,522,802,1233,1895,2912,

%T 4476,6879,10573,16250,24976,38387,59000,90681,139374,214214,329241,

%U 506035,777762,1195400,1837298,2823879,4340228,6670816,10252869,15758391,24220233

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

%t RecurrenceTable[{a[0]==0,a[1]==1,a[2]==2,a[n]==a[n-1]+Floor[(a[n-2]+ a[n-3])/2]},a,{n,50}] (* _Harvey P. Dale_, Aug 25 2014 *)

%o (PARI) a(n) = if (n < 3, n, a(n-1) + (a(n-2)+a(n-3))\2) \\ _Michel Marcus_, Jul 10 2013

%Y Cf. A214039, A214041.

%K nonn

%O 0,3

%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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 17 04:18 EDT 2024. Contains 375984 sequences. (Running on oeis4.)