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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A229137 a(1) = a(2) = 1; if n == 0 (mod 3), then a(n) = a(n/3), otherwise a(n) = a(n-1) + a(n-2). 1
 1, 1, 1, 2, 3, 1, 4, 5, 1, 6, 7, 2, 9, 11, 3, 14, 17, 1, 18, 19, 4, 23, 27, 5, 32, 37, 1, 38, 39, 6, 45, 51, 7, 58, 65, 2, 67, 69, 9, 78, 87, 11, 98, 109, 3, 112, 115, 14, 129, 143, 17, 160, 177, 1, 178, 179, 18, 197, 215, 19, 234, 253, 4, 257, 261, 23, 284 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,4 COMMENTS A distant cousin of Fibonacci numbers. - T. D. Noe, Sep 23 2013 LINKS T. D. Noe, Table of n, a(n) for n = 1..10000 MATHEMATICA f[1] = f[2] = 1; f[n_] := f[n] = If[Mod[n, 3] == 0, f[n/3], (f[n - 1] + f[n - 2])]; Table[f[n], {n, 100}] CROSSREFS Cf. A030067. Sequence in context: A094137 A038802 A092942 * A358631 A358106 A282510 Adjacent sequences: A229134 A229135 A229136 * A229138 A229139 A229140 KEYWORD nonn AUTHOR José María Grau Ribas, Sep 23 2013 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 September 11 09:25 EDT 2024. Contains 375815 sequences. (Running on oeis4.)