Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A132608
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A132608 Self-convolution square-root of A062817 (offset 2); thus g.f. A(x) satisfies: A(x)^2 = Sum(n>=2} A062817(n)*x^n, where A062817(n) = Sum_{k=0..n} (n-k)^k*k^(n-k). +0
3
1, 2, 9, 58, 469, 4530, 50491, 634790, 8861043, 135750454, 2262315973, 40726646802, 787471241647, 16275700505510, 358103286781293, 8357593147404346, 206241859929682177, 5366082228239257410 (list; graph; listen)
OFFSET

1,2

EXAMPLE

A(x) = x + 2x^2 + 9x^3 + 58x^4 + 469x^5 + 4530x^6 +...+ a(n)*x^n +...

A(x)^2 = x^2 + 4x^3 + 22x^4 + 152x^5 + 1251x^6 +...+ A062817(n)*x^n +...

PROGRAM

(PARI) {a(n)=polcoeff((sum(m=2, n+1, sum(k=0, m, (m-k)^k*k^(m-k))*x^m +x*O(x^(n+1))))^(1/2), n)}

CROSSREFS

Cf. A062817; A132609.

Sequence in context: A141787 A047852 A116867 this_sequence A080834 A059115 A005364

Adjacent sequences: A132605 A132606 A132607 this_sequence A132609 A132610 A132611

KEYWORD

nonn

AUTHOR

Paul D. Hanna (pauldhanna(AT)juno.com), Aug 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 December 4 15:51 EST 2008. Contains 151308 sequences.


AT&T Labs Research