Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A137958
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A137958 G.f. satisfies A(x) = 1 + x*(1 + x*A(x)^3)^4. +0
6
1, 1, 4, 18, 100, 587, 3660, 23640, 157076, 1066281, 7363620, 51568732, 365369868, 2614235293, 18862816112, 137096744232, 1002785827620, 7376023180645, 54525165453672, 404858512190316, 3018190533410664, 22581907465905018 (list; graph; listen)
OFFSET

0,3

FORMULA

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

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

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

CROSSREFS

Cf. A137957, A137959; A137956, A137964, A137971.

Sequence in context: A020027 A084832 A135177 this_sequence A064852 A159666 A051827

Adjacent sequences: A137955 A137956 A137957 this_sequence A137959 A137960 A137961

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 17 23:40 EST 2009. Contains 171025 sequences.


AT&T Labs Research