id:A119350 - OEIS Search Results

Search: id:A119350

Displaying 1-1 of 1 results found.

page 1

A119350

First differences of A118374.

+0
2

1, 1, 4, 1, 1, 1, 1, 6, 1, 1, 4, 1, 1, 1, 1, 1, 1, 1, 1, 10, 1, 1, 4, 1, 1, 1, 1, 6, 1, 1, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 18, 1, 1, 4, 1, 1, 1, 1, 6, 1, 1, 4, 1, 1, 1, 1, 1, 1, 1, 1, 10, 1, 1, 4, 1, 1, 1, 1, 6, 1, 1, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1 (list; graph; listen)

	OFFSET	`1,3`
	FORMULA	`Conjecture. Define g(1)=1 and, for i>1, g(i)=2*g(i-1)+2^(i-2). Also define h(1)=1, h(2)=4 and, for i>2, h(i)=h(i-1)+2^(i-2). Then a(n)=h(i) if n=g(i), a(n)=1 if g(i)-2^(i-2)<=n<g(i) and a(n)=a(n-g(i-1)) if g(i-1)<n<g(i)-2^(i-2). (This has been verified for the first 1000 terms.)`
	CROSSREFS	`Cf. A118374, A114889, A114890.` `Sequence in context: A066701 A046563 A046591 this_sequence A016528 A056623 A038025` `Adjacent sequences: A119347 A119348 A119349 this_sequence A119351 A119352 A119353`
	KEYWORD	`nonn`
	AUTHOR	`John W. Layman (layman(AT)math.vt.edu), May 23 2006`

page 1

Search completed in 0.002 seconds

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.

AT&T Labs Research