Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A107659
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A107659 Sum 2^max(k,n-k),k=0..n. +0
3
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; listen)
OFFSET

0,2

FORMULA

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

CROSSREFS

Cf. A027383.

Sequence in context: A022569 A093831 A052365 this_sequence A162588 A080615 A097976

Adjacent sequences: A107656 A107657 A107658 this_sequence A107660 A107661 A107662

KEYWORD

nonn,easy

AUTHOR

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 24 23:16 EST 2009. Contains 167481 sequences.


AT&T Labs Research