id:A082388 - OEIS Search Results

Search: id:A082388

Displaying 1-1 of 1 results found.

page 1

a(1) = 1, a(2) = 2; further terms are defined by rules that for k>=2, a(2^k-i)=a(2^k+i) for 1<=i<=2^k-1 and a(2^k)=a(2^(k-1))+sum_{i < 2^k} a(i).

+0
2

1, 2, 1, 6, 1, 2, 1, 20, 1, 2, 1, 6, 1, 2, 1, 68, 1, 2, 1, 6, 1, 2, 1, 20, 1, 2, 1, 6, 1, 2, 1, 232, 1, 2, 1, 6, 1, 2, 1, 20, 1, 2, 1, 6, 1, 2, 1, 68, 1, 2, 1, 6, 1, 2, 1, 20, 1, 2, 1, 6, 1, 2, 1, 792, 1, 2, 1, 6, 1, 2, 1, 20, 1, 2, 1, 6, 1, 2, 1, 68, 1, 2, 1, 6, 1, 2, 1, 20, 1, 2, 1, 6, 1, 2, 1, 232, 1, 2, 1 (list; graph; listen)

	OFFSET	`1,2`
	FORMULA	`a(2^k)=4a(2^(k-1))-2a(2^(k-2)); a(2^k)=round(1/2*(2+sqrt(2))^k)`
	CROSSREFS	`Sequence in context: A089808 A139547 A126342 this_sequence A085099 A154744 A048671` `Adjacent sequences: A082385 A082386 A082387 this_sequence A082389 A082390 A082391`
	KEYWORD	`nonn`
	AUTHOR	`Benoit Cloitre (benoit7848c(AT)orange.fr), Apr 14 2003`

page 1

Search completed in 0.004 seconds

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

AT&T Labs Research