login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A082388 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). 1
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; refs; listen; history; internal format)
OFFSET

1,2

FORMULA

a(2^k)=4*a(2^(k-1))-2*a(2^(k-2)); a(2^k)=round(1/2*(2+sqrt(2))^k)

CROSSREFS

Sequence in context: A089808 A139547 A126342 * A178254 A085099 A193807

Adjacent sequences:  A082385 A082386 A082387 * A082389 A082390 A082391

KEYWORD

nonn

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), Apr 14 2003

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 14 22:48 EST 2012. Contains 205682 sequences.