login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A121372 Triangle, read by rows of length A003056(n) for n>=1, defined by the recurrence: T(n,k) = T(n-k,k-1) - T(n-k,k) for n>k>1, with T(n,1)=(-1)^(n-1) for n>=1. 0
1, -1, 1, 1, -1, -1, 1, 0, -1, 0, 1, 1, 1, -1, -1, -1, 0, 1, 0, -1, -1, 0, 2, 1, 1, 1, -1, -1, -1, -1, 1, 0, 1, 0, -2, -1, -1, 0, 2, 1, 1, 1, -2, 0, 1, -1, -1, 2, 1, -1, 1, 0, -2, -1, 0, -1, 0, 3, 1, -1, 1, 1, -3, -2, 1, -1, -1, 2, 1, -1, 1, 0, -3, -1, 2, 1, -1, 0, 4, 2, -1, -1, 1, 1, -3, -1, 2, 0, -1, -1, 3, 1, -3, -1, 1, 0, -4, -2, 2, 1, -1, 0, 4, 2, -3 (list; graph; refs; listen; history; internal format)
OFFSET

1,23

COMMENTS

Row sums equal A003406 (offset 1), the expansion of Ramanujan's function: R(x) = 1 + Sum_{n>=1} { x^(n*(n+1)/2) / ((1+x)(1+x^2)(1+x^3)...(1+x^n)) }.

FORMULA

G.f. of column k: x^(k*(k+1)/2) / ((1+x)(1+x^2)(1+x^3)...(1+x^k)) for k>=1.

EXAMPLE

Triangle begins:

1;

-1;

1, 1;

-1,-1;

1, 0;

-1, 0, 1;

1, 1,-1;

-1,-1, 0;

1, 0,-1;

-1, 0, 2, 1;

1, 1,-1,-1;

-1,-1, 1, 0;

1, 0,-2,-1;

-1, 0, 2, 1;

1, 1,-2, 0, 1;

-1,-1, 2, 1,-1;

1, 0,-2,-1, 0;

-1, 0, 3, 1,-1;

1, 1,-3,-2, 1;

-1,-1, 2, 1,-1;

PROG

(PARI) {T(n, k)=if(n<k|k<1, 0, if(n==1, 1, T(n-k, k-1)-T(n-k, k)))}

CROSSREFS

Cf. A003406, A008289.

Sequence in context: A037912 A056980 A005094 * A123706 A194325 A025452

Adjacent sequences:  A121369 A121370 A121371 * A121373 A121374 A121375

KEYWORD

sign,tabf

AUTHOR

Paul D. Hanna (pauldhanna(AT)juno.com), Jul 24 2006

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 21:10 EST 2012. Contains 205856 sequences.