id:A061393 - OEIS Search Results

Search: id:A061393

Displaying 1-1 of 1 results found.

page 1

Number of appearances of n in sequence defined by b(k)=b(floor[k/3])+b(ceiling[k/3]) with b(0)=0 and b(1)=1, i.e. in A061392.

+0
3

1, 2, 4, 2, 10, 2, 4, 2, 28, 2, 4, 2, 10, 2, 4, 2, 82, 2, 4, 2, 10, 2, 4, 2, 28, 2, 4, 2, 10, 2, 4, 2, 244, 2, 4, 2, 10, 2, 4, 2, 28, 2, 4, 2, 10, 2, 4, 2, 82, 2, 4, 2, 10, 2, 4, 2, 28, 2, 4, 2, 10, 2, 4, 2, 730, 2, 4, 2, 10, 2, 4, 2, 28, 2, 4, 2, 10, 2, 4, 2, 82, 2, 4, 2, 10, 2, 4, 2, 28, 2, 4, 2 (list; graph; listen)

	OFFSET	`0,2`
	LINKS	`Michael Gilleland, Some Self-Similar Integer Sequences` `R. Stephan, Some divide-and-conquer sequences ...` `R. Stephan, Table of generating functions`
	FORMULA	`a(n) = A034472(A007814(n)). a(2n) = 3a(n)-2; a(2n+1) = 2.` `G.f. 1/(1-x) + sum(k>=0, 3^k*x^2^k/(1-x^2^(k+1))). - Ralf Stephan (ralf(AT)ark.in-berlin.de), Jun 13 2003`
	CROSSREFS	`Sequence in context: A008303 A058942 A072866 this_sequence A055935 A086930 A099585` `Adjacent sequences: A061390 A061391 A061392 this_sequence A061394 A061395 A061396`
	KEYWORD	`nonn`
	AUTHOR	`Henry Bottomley (se16(AT)btinternet.com), Apr 30 2001`

page 1

Search completed in 0.002 seconds

Last modified December 2 11:54 EST 2009. Contains 167921 sequences.

AT&T Labs Research