Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A132427
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A132427 Triangle, read by rows of 2n+1 terms, where T(n,k) = T(n,k-1) + T(n-1,k-2) for n>0, 1<k<=2n, with T(n,1)=T(n,0)=T(n-1,2n-2) for n>0 and T(0,0)=1. +0
2
1, 1, 1, 2, 2, 2, 3, 4, 6, 6, 6, 8, 10, 13, 17, 23, 23, 23, 29, 35, 43, 53, 66, 83, 106, 106, 106, 129, 152, 181, 216, 259, 312, 378, 461, 567, 567, 567, 673, 779, 908, 1060, 1241, 1457, 1716, 2028, 2406, 2867, 3434, 3434, 3434, 4001, 4568, 5241, 6020, 6928, 7988 (list; table; graph; listen)
OFFSET

0,4

COMMENT

Column 0 (shift left) equals column 1 and the right-most border.

FORMULA

The g.f. of column 0 (A125273) satisfies: G(x) = 1 + x*G( x/(1-x)^2 ) / (1-x). The central terms (A132428) equals the inverse binomial transform of A125273 (offset 1).

EXAMPLE

Triangle begins:

1;

1, 1, 2;

2, 2, 3, 4, 6;

6, 6, 8, 10, 13, 17, 23;

23, 23, 29, 35, 43, 53, 66, 83, 106;

106, 106, 129, 152, 181, 216, 259, 312, 378, 461, 567;

567, 567, 673, 779, 908, 1060, 1241, 1457, 1716, 2028, 2406, 2867, 3434; ...

PROGRAM

(PARI) {T(n, k)=local(A=[1]); if(2*n<k|k<0, 0, if(n==0&k==0, 1, if(k==0|k==1, T(n-1, 2*n-2), for(i=1, n, A=Vec(Ser(concat([A[ #A], 0], A))/(1-x))); A[k+1])))}

CROSSREFS

Cf. A125273; A132428 (central terms).

Sequence in context: A022865 A089150 A056697 this_sequence A098523 A048185 A095094

Adjacent sequences: A132424 A132425 A132426 this_sequence A132428 A132429 A132430

KEYWORD

nonn,tabl

AUTHOR

Paul D. Hanna (pauldhanna(AT)juno.com), Aug 21 2007

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 3 01:16 EST 2008. Contains 151161 sequences.


AT&T Labs Research