Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A105669
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A105669 A "fractal" transform of the Fibonacci numbers F(n)=A000045(n): a(1)=1, then for n>1 if F(n)<k<F(n+1) we have a(k)=F(n+1)-a(k-F(n)) and when k=F(n+1) we force a(F(n+1))=F(n+1)+(1+(-1)^n)*(F(n). +0
6
1, 2, 2, 4, 7, 7, 6, 6, 12, 11, 11, 9, 20, 20, 19, 19, 17, 14, 14, 15, 15, 33, 32, 32, 30, 27, 27, 28, 28, 22, 23, 23, 25, 54, 54, 53, 53, 51, 48, 48, 49, 49, 43, 44, 44, 46, 35, 35, 36, 36, 38, 41, 41, 40, 40, 88, 87, 87, 85, 82, 82, 83, 83, 77, 78, 78, 80, 69, 69, 70, 70, 72 (list; graph; listen)
page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 16 17:18 EST 2009. Contains 170825 sequences.


AT&T Labs Research