Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A137963
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A137963 G.f. satisfies A(x) = 1 + x*(1 + x*A(x)^3)^5. +0
6
1, 1, 5, 25, 160, 1075, 7671, 56760, 431865, 3357790, 26558520, 213032988, 1728808700, 14168337265, 117096909495, 974842628790, 8167462511193, 68813778610350, 582675107162175, 4955767502292960, 42318868510894860 (list; graph; listen)
OFFSET

0,3

FORMULA

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

a(n) = Sum_{k=0..n-1} C(5*(n-k),k)/(n-k) * C(3*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^3)^5); polcoeff(A, n)}

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

CROSSREFS

Cf. A137962, A137964; A137961, A137965, A137973.

Sequence in context: A090014 A097145 A085644 this_sequence A144887 A134007 A125794

Adjacent sequences: A137960 A137961 A137962 this_sequence A137964 A137965 A137966

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 November 29 12:46 EST 2009. Contains 167659 sequences.


AT&T Labs Research