A022290 - OEIS

This site is supported by donations to The OEIS Foundation.

A022290

Replace 2^k in binary expansion of n by k-th Fibonacci number.

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; refs; listen; history; internal format)

	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).` `a(n)=Sum_k>=0 {A030308(n,k)A000045(k+2)}. - From DELEHAM Philippe, Oct 15 2011.`
	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: A007998 A202704 A029931 * A185363 A103827 A094182` `Adjacent sequences: A022287 A022288 A022289 * A022291 A022292 A022293`
	KEYWORD	`nonn`
	AUTHOR	`Marc LeBrun (mlb(AT)well.com)`

Content is available under The OEIS End-User License Agreement .

Last modified February 14 11:36 EST 2012. Contains 205623 sequences.