Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A125273
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A125273 Eigensequence of triangle A085478: a(n) = Sum_{k=0..n-1} A085478(n-1,k)*a(k) for n>0 with a(0)=1. +0
7
1, 1, 2, 6, 23, 106, 567, 3434, 23137, 171174, 1376525, 11934581, 110817423, 1095896195, 11487974708, 127137087319, 1480232557526, 18075052037054, 230855220112093, 3076513227516437, 42686898298650967, 615457369662333260 (list; graph; listen)
OFFSET

0,3

FORMULA

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

G.f. satisfies: A(x) = 1 + x*A( x/(1-x)^2 ) / (1-x). - Paul D. Hanna (pauldhanna(AT)juno.com), Aug 15 2007

EXAMPLE

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

a(4) = 1*(1) + 6*(1) + 5*(2) + 1*(6) = 23;

a(5) = 1*(1) + 10*(1) + 15*(2) + 7*(6) + 1*(23) = 106.

Triangle A085478(n,k) = C(n+k,n-k) begins:

1;

1, 1;

1, 3, 1;

1, 6, 5, 1;

1, 10, 15, 7, 1;

1, 15, 35, 28, 9, 1; ...

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

PROGRAM

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

CROSSREFS

Cf. A085478; A125274 (variant).

Sequence in context: A080108 A113227 A165489 this_sequence A130908 A000772 A113226

Adjacent sequences: A125270 A125271 A125272 this_sequence A125274 A125275 A125276

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 November 25 08:46 EST 2009. Contains 167481 sequences.


AT&T Labs Research