id:A089265 - OEIS Search Results

Search: id:A089265

Displaying 1-1 of 1 results found.

page 1

a(1) = 0; thereafter a(2n) = a(n) + 1, a(2n+1) = 2n.

+0
2

0, 1, 2, 2, 4, 3, 6, 3, 8, 5, 10, 4, 12, 7, 14, 4, 16, 9, 18, 6, 20, 11, 22, 5, 24, 13, 26, 8, 28, 15, 30, 5, 32, 17, 34, 10, 36, 19, 38, 7, 40, 21, 42, 12, 44, 23, 46, 6, 48, 25, 50, 14, 52, 27, 54, 9, 56, 29, 58, 16, 60, 31, 62, 6, 64, 33, 66, 18, 68, 35, 70, 11, 72 (list; graph; listen)

	OFFSET	`1,3`
	LINKS	`T. D. Noe, Table of n, a(n) for n=1..1000`
	FORMULA	`a(n) = A007814(n) + 2*A025480(n-1) = A007814(n) + A000265(n) - 1.` `G.f.: sum(k>=0, (t^2+2t^3-t^4)/(1-t^2)^2, t=x^2^k).`
	PROGRAM	`(PARI) a(n)=valuation(n, 2)+n/2^valuation(n, 2)-1`
	CROSSREFS	`First differences of A005766.` `Cf. A003602.` `Adjacent sequences: A089262 A089263 A089264 this_sequence A089266 A089267 A089268` `Sequence in context: A058266 A138664 A140357 this_sequence A113885 A113886 A122376`
	KEYWORD	`nonn,easy`
	AUTHOR	`Ralf Stephan (ralf(AT)ark.in-berlin.de), Oct 30 2003`

page 1

Search completed in 0.002 seconds

Last modified October 13 20:18 EDT 2008. Contains 145016 sequences.

AT&T Labs Research