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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A107659 Sum 2^max(k,n-k),k=0..n. 2
1, 4, 10, 24, 52, 112, 232, 480, 976, 1984, 4000, 8064, 16192, 32512, 65152, 130560, 261376, 523264, 1047040, 2095104, 4191232, 8384512, 16771072, 33546240, 67096576, 134201344, 268410880, 536838144, 1073692672, 2147418112 (list; graph; refs; listen; history; internal format)
OFFSET

0,2

FORMULA

a(2n) = 2^n(2^(n+2)-3), a(2n+1) = 2^n(2^(n+3)-4).

G.f.: (1+2*x)/[(1-2*x)*(1-2*x^2)].

CROSSREFS

Cf. A027383.

Sequence in context: A022569 A093831 A052365 * A162588 A080615 A173729

Adjacent sequences:  A107656 A107657 A107658 * A107660 A107661 A107662

KEYWORD

nonn,easy

AUTHOR

Mitch Harris (harris (AT) tcs.inf.tu-dresden.de)

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 16 09:00 EST 2012. Contains 205904 sequences.