Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A135068
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A135068 a(n) = [x^(2^n+n-1)] (x + x^2 + x^4 +...+ x^2^n)^n for n>=1. +0
4
1, 2, 6, 16, 90, 636, 5712, 34336, 537282, 5941780, 99729146, 1049982792, 23200347040, 293841338896, 5712436923000, 68827002466176, 2844850573581890, 53069160498788772, 1545326270301621838 (list; graph; listen)
OFFSET

1,2

FORMULA

n divides a(n): A135069(n) = a(n)/n for n>=1.

PROGRAM

(PARI) a(n)=if(n<1, 0, polcoeff(sum(j=0, n, x^(2^j)+O(x^(2^n+n)))^n, 2^n+n-1))

CROSSREFS

Cf. A007178 (variant); A135069, A135070 (variant), A135071.

Sequence in context: A147889 A137858 A074740 this_sequence A147950 A147941 A147932

Adjacent sequences: A135065 A135066 A135067 this_sequence A135069 A135070 A135071

KEYWORD

more,nonn

AUTHOR

Paul D. Hanna (pauldhanna(AT)juno.com), Nov 17 2007

EXTENSIONS

a(15) - a(19) from Alois P. Heinz (heinz(AT)hs-heilbronn.de), Apr 29 2009

page 1

Search completed in 0.005 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 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research