Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A137962
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A137962 G.f. satisfies A(x) = 1 + x*(1 + x*A(x)^5)^3. +0
6
1, 1, 3, 18, 106, 720, 5085, 37493, 284331, 2204973, 17404720, 139369905, 1129411314, 9244823986, 76326154857, 634847759955, 5314684735045, 44746683774474, 378652035541761, 3218705637379698, 27471657413667780 (list; graph; listen)
OFFSET

0,3

FORMULA

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

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

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

CROSSREFS

Cf. A137963, A137961; A137953, A137957, A137969.

Sequence in context: A007277 A025595 A151331 this_sequence A081341 A132900 A050623

Adjacent sequences: A137959 A137960 A137961 this_sequence A137963 A137964 A137965

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 13 23:45 EST 2009. Contains 170824 sequences.


AT&T Labs Research