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

%I #7 May 20 2013 08:37:35

%S 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,

%T 5,1,204,140,91,55,30,14,5,1,285,204,140,91,55,30,14,5,1,385,285,204,

%U 140,91,55,30,14,5,1,506,385,285,204,140,91,55,30,14,5,1,650,506,385,285

%N Triangle T(n,k) = A000330(n-k), n>=1, 0<=k<n, read by rows.

%C Repeatedly writing the square pyramidal numbers (A000330) backwards.

%F T(n,k) = (n-k)(n-k+1)(2n-2k+1)/6 = A000330(A004736(n)). - _Ralf Stephan_, Apr 05 2009

%e First few rows of the triangle are:

%e 1;

%e 5, 1;

%e 14, 5, 1;

%e 30, 14, 5, 1;

%e 55, 30, 14, 5, 1;

%e 91, 55, 30, 14, 5, 1;

%e ...

%Y Row sums are in A002415. Antidiagonals are in A000332.

%K nonn,easy,tabl

%O 1,2

%A _Gary W. Adamson_, Mar 26 2005

%E Edited by _Ralf Stephan_, Apr 05 2009

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 August 27 08:13 EDT 2024. Contains 375462 sequences. (Running on oeis4.)