Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A082173
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A082173 a(0)=1, for n>=1 a(n)=sum(k=0,n,11^k*N(n,k)) where N(n,k) =1/n*C(n,k)*C(n,k+1) are the Narayana numbers (A001263). +0
7
1, 1, 12, 155, 2124, 30482, 453432, 6936799, 108507180, 1727970542, 27924685416, 456820603086, 7550600079672, 125905525750500, 2115511349837040, 35782547891727495, 608787760350045420, 10411451736723707990 (list; graph; listen)
OFFSET

0,3

COMMENT

More generally coefficients of (1+m*x-sqrt(m^2*x^2-(2*m+4)*x+1))/((2*m+2)*x) are given by : a(n)=sum(k=0,n,(m+1)^k*N(n,k))

The Hankel transform of this sequence is 11^C(n+1,2) . - Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Oct 29 2007

FORMULA

G.f. (1+10*x-sqrt(100*x^2-24*x+1))/(22*x)

a(n) = Sum_{k=0..n} A088617(n, k)*11^k*(-10)^(n-k) . - DELEHAM Philippe (kolotoko(AT)wanadoo.fr), Jan 21 2004

a(n) = [12(2n-1)a(n-1) - 100(n-2)a(n-2)] / (n+1) for n>=2, a(0) = a(1) = 1 . - Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Aug 19 2005

PROGRAM

(PARI) a(n)=if(n<1, 1, sum(k=0, n, 11^k/n*binomial(n, k)*binomial(n, k+1)))

CROSSREFS

Cf. A001003, A007564, A059231.

Sequence in context: A120657 A015612 A085260 this_sequence A005723 A097259 A158546

Adjacent sequences: A082170 A082171 A082172 this_sequence A082174 A082175 A082176

KEYWORD

nonn

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), May 10 2003

page 1

Search completed in 0.005 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