Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A088556
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A088556 Numbers of the form (4^n + 4^(n-1) + ... + 1) + (n mod 2). +0
1
6, 21, 86, 341, 1366, 5461, 21846, 87381, 349526, 1398101, 5592406, 22369621, 89478486, 357913941, 1431655766, 5726623061, 22906492246, 91625968981, 366503875926, 1466015503701, 5864062014806, 23456248059221, 93824992236886 (list; graph; listen)
OFFSET

1,1

FORMULA

If n is even, then 4^n + ... + 1 = (4^(n+1) - 1)/3 = (2^(n+1) - 1)(2^n+1) + 1)/3. - R. K. Guy, Nov 17, 2003

PROGRAM

(PARI) trajpolypn(n1) = { for(x1=1, n1, y1 = polypn(4, x1); print1(y1", ") ) } polypn(n, p) = { x=n; if(p%2, y=2, y=1); for(m=1, p, y=y+x^m; ); return(y) }

CROSSREFS

Sequence in context: A053768 A108306 A134927 this_sequence A137966 A005498 A002222

Adjacent sequences: A088553 A088554 A088555 this_sequence A088557 A088558 A088559

KEYWORD

nonn

AUTHOR

Cino Hilliard (hillcino368(AT)gmail.com), Nov 17 2003

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 August 29 17:54 EDT 2008. Contains 143238 sequences.


AT&T Labs Research