The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 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; text; 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)) }. LINKS 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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified July 23 12:19 EDT 2021. Contains 346259 sequences. (Running on oeis4.)