Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A125275
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A125275 Eigensequence of triangle A039599: a(n) = Sum_{k=0..n-1} A039599(n-1,k)*a(k) for n>0 with a(0)=1. +0
2
1, 1, 2, 7, 31, 162, 968, 6481, 47893, 386098, 3364562, 31460324, 313743665, 3320211313, 37124987124, 436985496790, 5397178181290, 69748452377058, 940762812167126, 13213888481979449, 192891251215160017 (list; graph; listen)
OFFSET

0,3

FORMULA

a(n) = Sum_{k=0..n-1} a(k) * C(2*n-1,n-k-1)*(2*k+1)/(2*n-1) for n>0 with a(0)=1.

EXAMPLE

a(3) = 2*(1) + 3*(1) + 1*(2) = 7;

a(4) = 5*(1) + 9*(1) + 5*(2) + 1*(7) = 31;

a(5) = 14*(1) + 28*(1) + 20*(2) + 7*(7) + 1*(31) = 162.

Triangle A039599(n,k) = C(2*n+1,n-k)*(2*k+1)/(2*n+1) begins:

1;

1, 1;

2, 3, 1;

5, 9, 5, 1;

14, 28, 20, 7, 1;

42, 90, 75, 35, 9, 1; ...

where g.f. of column k = G000108(x)^(2*k+1)

and G000108(x) = (1 - sqrt(1-4*x))/(2x) is the Catalan function.

PROGRAM

(PARI) a(n)=if(n==0, 1, sum(k=0, n-1, a(k)*binomial(2*n-1, n-k-1)*(2*k+1)/(2*n-1)))

CROSSREFS

Cf. A039599, A000108; A125276 (variant).

Sequence in context: A030882 A030966 A009132 this_sequence A007446 A002872 A105216

Adjacent sequences: A125272 A125273 A125274 this_sequence A125276 A125277 A125278

KEYWORD

nonn

AUTHOR

Paul D. Hanna (pauldhanna(AT)juno.com), Nov 26 2006

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 September 7 15:23 EDT 2008. Contains 143483 sequences.


AT&T Labs Research