id:A083661 - OEIS Search Results

Search: id:A083661

Displaying 1-1 of 1 results found.

page 1

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

+0
2

0, 0, 0, 1, 0, 1, 0, 2, 1, 1, 0, 2, 1, 1, 0, 3, 2, 2, 1, 2, 1, 1, 0, 3, 2, 2, 1, 2, 1, 1, 0, 4, 3, 3, 2, 3, 2, 2, 1, 3, 2, 2, 1, 2, 1, 1, 0, 4, 3, 3, 2, 3, 2, 2, 1, 3, 2, 2, 1, 2, 1, 1, 0, 5, 4, 4, 3, 4, 3, 3, 2, 4, 3, 3, 2, 3, 2, 2, 1, 4, 3, 3, 2, 3, 2, 2, 1, 3, 2, 2, 1, 2, 1 (list; graph; listen)

	OFFSET	`1,8`
	LINKS	`R. Stephan, Some divide-and-conquer sequences ...` `R. Stephan, Table of generating functions`
	FORMULA	`a(1)=a(2)=a(3)=0, a(2n) = a(n)+1, a(2n+1) = a(n).` `a(n) = A080791(n) + A079944(n-2) - 1.`
	PROGRAM	`(PARI) for(n=1, 120, l=ceil(log(n)/log(2)):t=polcoeff(1/(1-x)*sum(k=0, l, (x^2^(k+2))/(1+x^2^k)), n):print1(t", "))`
	CROSSREFS	`Cf. A000120, A023416.` `Adjacent sequences: A083658 A083659 A083660 this_sequence A083662 A083663 A083664` `Sequence in context: A115211 A060826 A078134 this_sequence A029369 A125072 A139146`
	KEYWORD	`nonn,easy`
	AUTHOR	`Ralf Stephan (ralf(AT)ark.in-berlin.de), Jun 14 2003`

page 1

Search completed in 0.002 seconds

Last modified October 15 09:18 EDT 2008. Contains 145015 sequences.

AT&T Labs Research