Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A022290
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A022290 Replace 2^k in binary expansion of n by k-th Fibonacci number. +0
5
0, 1, 2, 3, 3, 4, 5, 6, 5, 6, 7, 8, 8, 9, 10, 11, 8, 9, 10, 11, 11, 12, 13, 14, 13, 14, 15, 16, 16, 17, 18, 19, 13, 14, 15, 16, 16, 17, 18, 19, 18, 19, 20, 21, 21, 22, 23, 24, 21, 22, 23, 24, 24, 25, 26, 27, 26, 27, 28, 29, 29, 30, 31, 32, 21, 22, 23, 24, 24, 25, 26 (list; graph; listen)
OFFSET

0,3

FORMULA

G.f.: 1/(1-x) * sum[k>=0, F(k+2)*x^2^k/(1+x^2^k)], F(n)=A000045(n).

CROSSREFS

Other sequences that are built by replacing 2^k in the binary representation with other numbers: A029931 (naturals), A059590 (factorials), A089625 (primes).

Sequence in context: A156562 A007998 A029931 this_sequence A103827 A094182 A075699

Adjacent sequences: A022287 A022288 A022289 this_sequence A022291 A022292 A022293

KEYWORD

nonn

AUTHOR

Marc LeBrun (mlb(AT)well.com)

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 7 23:50 EST 2009. Contains 170430 sequences.


AT&T Labs Research