Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A137961
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A137961 G.f. satisfies A(x) = 1 + x*(1 + x*A(x)^2)^5. +0
6
1, 1, 5, 20, 105, 575, 3306, 19760, 121035, 757230, 4815530, 31039402, 202335855, 1331569725, 8834918160, 59035907480, 396937508816, 2683518356850, 18230570856710, 124390574548960, 852074529347120, 5857453791938135 (list; graph; listen)
OFFSET

0,3

FORMULA

G.f.: A(x) = 1 + x*B(x)^5 where B(x) is the g.f. of A137960.

a(n) = Sum_{k=0..n-1} C(5*(n-k),k)/(n-k) * C(2*k,n-k-1) for n>0 with a(0)=1. [From Paul D. Hanna (pauldhanna(AT)juno.com), Jun 16 2009]

PROGRAM

(PARI) {a(n)=local(A=1+x*O(x^n)); for(i=0, n, A=1+x*(1+x*A^2)^5); polcoeff(A, n)}

(PARI) a(n)=if(n==0, 1, sum(k=0, n-1, binomial(5*(n-k), k)/(n-k)*binomial(2*k, n-k-1))) [From Paul D. Hanna (pauldhanna(AT)juno.com), Jun 16 2009]

CROSSREFS

Cf. A137960, A137962; A137963, A137965, A137973.

Sequence in context: A092640 A165961 A109500 this_sequence A167145 A020039 A117736

Adjacent sequences: A137958 A137959 A137960 this_sequence A137962 A137963 A137964

KEYWORD

nonn

AUTHOR

Paul D. Hanna (pauldhanna(AT)juno.com), Feb 26 2008

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 8 08:31 EST 2009. Contains 170430 sequences.


AT&T Labs Research