Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A078018
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A078018 a(0)=1, for n>=1 a(n)=sum(k=0,n,6^k*N(n,k)) where N(n,k) =1/n*C(n,k)*C(n,k+1) are the Narayana numbers (A001263). +0
8
1, 1, 7, 55, 469, 4237, 39907, 387739, 3858505, 39130777, 402972031, 4202705311, 44299426717, 471189693925, 5051001609115, 54513542257795, 591858123926545, 6459813793353265, 70837427884259575, 780073647992404615 (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 6^C(n+1,2) . - Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Oct 29 2007

REFERENCES

Paul Barry, On Integer-Sequence-Based Constructions of Generalized Pascal Triangles, Journal of Integer Sequences, Vol. 9 (2006), Article 06.2.4.

FORMULA

G.f. (1+5*x-sqrt(25*x^2-14*x+1))/(12*x)

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

a(n) = [7(2n-1)a(n-1) - 25(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, 6^k/n*binomial(n, k)*binomial(n, k+1)))

CROSSREFS

Cf. A001003, A007564, A059231.

Adjacent sequences: A078015 A078016 A078017 this_sequence A078019 A078020 A078021

Sequence in context: A049028 A096951 A113714 this_sequence A108628 A116862 A096307

KEYWORD

nonn

AUTHOR

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

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 October 15 09:18 EDT 2008. Contains 145015 sequences.


AT&T Labs Research