Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A137966
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A137966 G.f. satisfies A(x) = 1+x + x^2*A(x)^6. +0
5
1, 1, 1, 6, 21, 86, 396, 1812, 8607, 41958, 207333, 1040234, 5281965, 27078756, 140021248, 729369474, 3823598232, 20158251814, 106809280563, 568471343322, 3037782047947, 16292380484454, 87669285293451, 473172657154822 (list; graph; listen)
OFFSET

0,4

FORMULA

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

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

CROSSREFS

Cf. A137967, A137965; A019497, A137954, A137959.

Sequence in context: A108306 A134927 A088556 this_sequence A005498 A002222 A006359

Adjacent sequences: A137963 A137964 A137965 this_sequence A137967 A137968 A137969

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 18 21:37 EST 2009. Contains 171024 sequences.


AT&T Labs Research