Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A134087
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A134087 a(n) = [x^n] G(x)^(2^(n+1)) where G(x) satisfies: [x^(n+1)] G(x)^(2^n) = [x^n] G(x)^(2^n) for n>=0, and G(2x) is the g.f. of A134084. +0
6
1, 4, 32, 672, 42816, 8822400, 6065609984, 14256471226880, 117000916309144576, 3410202131850138806272, 357670541003601468527333376, 136391046228660672398602237353984 (list; graph; listen)
OFFSET

0,2

FORMULA

a(n) = 2^n * A134089(n).

PROGRAM

(PARI) {a(n)=local(A=[1], B); for(i=1, n, A=concat(A, 0); B=Vec(Ser(A)^(2^(#A-2))); A[ #A]=(B[ #B-1]-B[ #B])/2^(#A-2)); Vec(Ser(A)^(2^(n+1)))[n+1]}

CROSSREFS

Cf. A134084, A134085, A134086, A134088, A134089.

Sequence in context: A013041 A006024 A118995 this_sequence A132854 A136471 A028369

Adjacent sequences: A134084 A134085 A134086 this_sequence A134088 A134089 A134090

KEYWORD

nonn

AUTHOR

Paul D. Hanna (pauldhanna(AT)juno.com), Oct 26 2007

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 July 26 23:19 EDT 2008. Contains 142293 sequences.


AT&T Labs Research