Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A135070
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A135070 a(n) = [x^(2^n+n-2)] (x + x^2 + x^4 +...+ x^(2^n))^n for n>=2. +0
4
1, 3, 18, 70, 600, 4956, 52528, 358128, 6654600, 79967800, 1453049400, 16239408120, 392541718660, 5252687631660, 108961629396480, 1395025456201408, 62831427044385384, 1223872353413404344 (list; graph; listen)
OFFSET

2,2

FORMULA

n(n-1)/2 divides a(n): A135071(n) = a(n)/[n(n-1)/2] for n>=2.

PROGRAM

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

CROSSREFS

Cf. A135068, A135069, A135071.

Sequence in context: A157535 A098522 A114633 this_sequence A073961 A152897 A059393

Adjacent sequences: A135067 A135068 A135069 this_sequence A135071 A135072 A135073

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.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 20 16:54 EST 2009. Contains 171081 sequences.


AT&T Labs Research