Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A076448
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A076448 Numbers one more than a power of 2 which are the sum of n consecutive numbers one more than a power of 2. +0
1
5, 17, 129, 4097, 2097153, 274877906945, 2361183241434822606849, 87112285931760246646623899502532662132737, 59285549689505892056868344324448208820874232148807968788202283012051522375647233 (list; graph; listen)
OFFSET

2,1

FORMULA

a(n) =2^(2^(n-2)+n-1)+1 = A000051(A005126(n-2)).

EXAMPLE

a(2)=5=2+3, a(3)=17=3+5+9, a(4)=129=5+9+17+33+65.

CROSSREFS

Sequence in context: A012259 A113936 A012263 this_sequence A096310 A071057 A119769

Adjacent sequences: A076445 A076446 A076447 this_sequence A076449 A076450 A076451

KEYWORD

nonn

AUTHOR

Henry Bottomley (se16(AT)btinternet.com), Nov 07 2002

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 December 18 21:37 EST 2009. Contains 171024 sequences.


AT&T Labs Research