Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A137957
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A137957 G.f. satisfies A(x) = 1 + x*(1 + x*A(x)^4)^3. +0
6
1, 1, 3, 15, 79, 468, 2895, 18670, 123765, 838860, 5785503, 40473729, 286504086, 2048388112, 14770313397, 107290913232, 784380664232, 5766985753620, 42614014459911, 316304429143995, 2357275139670183, 17631888703154172 (list; graph; listen)
OFFSET

0,3

FORMULA

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

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

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

CROSSREFS

Cf. A137958, A137956; A137953, A137962, A137969.

Sequence in context: A104530 A031884 A052755 this_sequence A002514 A093889 A020044

Adjacent sequences: A137954 A137955 A137956 this_sequence A137958 A137959 A137960

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 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research