login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A104792 Triangle T(n,k) = A000330(n-k), n>=1, 0<=k<n, read by rows. 0
1, 5, 1, 14, 5, 1, 30, 14, 5, 1, 55, 30, 14, 5, 1, 91, 55, 30, 14, 5, 1, 140, 91, 55, 30, 14, 5, 1, 204, 140, 91, 55, 30, 14, 5, 1, 285, 204, 140, 91, 55, 30, 14, 5, 1, 385, 285, 204, 140, 91, 55, 30, 14, 5, 1, 506, 385, 285, 204, 140, 91, 55, 30, 14, 5, 1, 650, 506, 385, 285 (list; table; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
Repeatedly writing the square pyramidal numbers (A000330) backwards.
LINKS
FORMULA
T(n,k) = (n-k)(n-k+1)(2n-2k+1)/6 = A000330(A004736(n)). - Ralf Stephan, Apr 05 2009
EXAMPLE
First few rows of the triangle are:
1;
5, 1;
14, 5, 1;
30, 14, 5, 1;
55, 30, 14, 5, 1;
91, 55, 30, 14, 5, 1;
...
CROSSREFS
Row sums are in A002415. Antidiagonals are in A000332.
Sequence in context: A174504 A270654 A067558 * A120393 A370518 A094368
KEYWORD
nonn,easy,tabl
AUTHOR
Gary W. Adamson, Mar 26 2005
EXTENSIONS
Edited by Ralf Stephan, Apr 05 2009
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 16:40 EDT 2024. Contains 371916 sequences. (Running on oeis4.)