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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A097637 a(n) = Fibonacci(floor(n/16) + BinaryWeight(n mod 16)). 0
 0, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 2, 2, 3, 1, 1, 1, 2, 1, 2, 2, 3, 1, 2, 2, 3, 2, 3, 3, 5, 1, 2, 2, 3, 2, 3, 3, 5, 2, 3, 3, 5, 3, 5, 5, 8, 2, 3, 3, 5, 3, 5, 5, 8, 3, 5, 5, 8, 5, 8, 8, 13, 3, 5, 5, 8, 5, 8, 8, 13, 5, 8, 8, 13, 8, 13, 13, 21, 5, 8, 8, 13, 8, 13, 13, 21, 8, 13, 13, 21, 13, 21, 21, 34, 8 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,8 LINKS MATHEMATICA M={{0, 1}, {1, 1}}; A[0]:={{0, 1}, {1, 1}}; A[1]=M.A[0] A[2]=M.A[1] AA[0]:={{A[0], A[1]}, {A[1], A[2]}} MatrixForm[M.AA[0]] MatrixForm[AA[0]] a=Flatten[Table[MatrixPower[M, n].AA[0], {n, 0, 12}]] Dimensions[a] PROG (PARI) a(n)=fibonacci(n\16 + hammingweight(n%16)); \\ Andrew Howroyd, May 16 2021 CROSSREFS Cf. A000045, A000120. Sequence in context: A058761 A050119 A290253 * A161094 A307343 A340034 Adjacent sequences:  A097634 A097635 A097636 * A097638 A097639 A097640 KEYWORD nonn,easy,less,dumb AUTHOR Roger L. Bagula, Sep 20 2004 EXTENSIONS New name and edited, Joerg Arndt, May 16 2021 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.

Last modified June 22 04:06 EDT 2021. Contains 345367 sequences. (Running on oeis4.)