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

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A178306 a(0)=1, a(1)=a(2)=1 and a(3k) = a(k), a(3k+1) = a(k)+a(k+1), a(3k+2) = 2a(k) for k >= 1. 0
 0, 1, 1, 1, 2, 2, 1, 2, 2, 1, 3, 2, 2, 4, 4, 2, 3, 4, 1, 3, 2, 2, 4, 4, 2, 3, 4, 1, 4, 2, 3, 5, 6, 2, 4, 4, 2, 6, 4, 4, 8, 8, 4, 6, 8, 2, 5, 4, 3, 7, 6, 4, 5, 8, 1, 4, 2, 3, 5, 6, 2, 4, 4, 2, 6, 4, 4, 8, 8, 4, 6, 8, 2, 5, 4, 3, 7, 6, 4, 5, 8, 1, 5, 2, 4, 6, 8, 2, 5, 4, 3, 8, 6, 5, 11, 10, 6, 8, 12, 2, 6, 4, 4, 8 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,5 LINKS Table of n, a(n) for n=0..103. MATHEMATICA a[0] = 0; a[1] = 1; a[2] = 1; a[n_] := a[n] = If[Mod[ n, 3] == 0, a[Floor[n/3]], If[Mod[n, 3] == 1, a[Floor[(n - 1)/3]] + a[Floor[(n + 2)/3]], a[Floor[(n - 2)/3]] + a[Floor[n/3]]]]; Table[a[n], {n, 0, 200}] CROSSREFS Cf. A002487 Sequence in context: A025260 A227156 A123369 * A309363 A280153 A023671 Adjacent sequences: A178303 A178304 A178305 * A178307 A178308 A178309 KEYWORD nonn,easy AUTHOR Roger L. Bagula and Gary W. Adamson, May 24 2010 EXTENSIONS Definition simplified, Mma notation replaced - The Assoc. Eds. of the OEIS, Jul 20 2010 STATUS approved

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 December 4 04:49 EST 2023. Contains 367541 sequences. (Running on oeis4.)