Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A134086
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A134086 a(n) = [x^n] G(x)^(2^n) 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, 2, 8, 80, 2464, 255808, 90320512, 108630646016, 451779274750464, 6626041977171637248, 348460175972420307970048, 66523219303893985885632450560, 46531358180797100870477866170818560 (list; graph; listen)
OFFSET

0,2

FORMULA

a(n) = 2^n * A134088(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))[n+1]}

CROSSREFS

Cf. A134084, A134085, A134087, A134088, A134089.

Sequence in context: A130530 A134529 A134054 this_sequence A013175 A120820 A134089

Adjacent sequences: A134083 A134084 A134085 this_sequence A134087 A134088 A134089

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 November 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research