Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A137967
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A137967 G.f. satisfies A(x) = 1 + x*(1 + x*A(x)^6)^2. +0
6
1, 1, 2, 13, 66, 406, 2602, 17271, 118444, 829514, 5914980, 42791085, 313277294, 2316793170, 17281455882, 129867946828, 982293317064, 7472406051744, 57132051350160, 438797394096378, 3383870656327576, 26191385476141936 (list; graph; listen)
OFFSET

0,3

FORMULA

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

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

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

CROSSREFS

Cf. A137968, A137966; A137952, A137955, A137960.

Sequence in context: A037626 A037752 A037640 this_sequence A045764 A106999 A054566

Adjacent sequences: A137964 A137965 A137966 this_sequence A137968 A137969 A137970

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 24 23:16 EST 2009. Contains 167481 sequences.


AT&T Labs Research