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!)
A162615 Triangle read by rows in which row n lists n terms, starting with n, such that the difference between successive terms is equal to n^3 - 1 = A068601(n). 6

%I #14 Feb 21 2024 08:19:07

%S 1,2,9,3,29,55,4,67,130,193,5,129,253,377,501,6,221,436,651,866,1081,

%T 7,349,691,1033,1375,1717,2059,8,519,1030,1541,2052,2563,3074,3585,9,

%U 737,1465,2193,2921,3649,4377,5105,5833,10,1009,2008,3007,4006,5005,6004

%N Triangle read by rows in which row n lists n terms, starting with n, such that the difference between successive terms is equal to n^3 - 1 = A068601(n).

%C See also the triangles of A162614 and A162616.

%H Harvey P. Dale, <a href="/A162615/b162615.txt">Table of n, a(n) for n = 1..10000</a>

%F Row sums: n*(n^4 - n^3 + n + 1)/2. - _R. J. Mathar_, Jul 20 2009

%e Triangle begins:

%e 1;

%e 2, 9;

%e 3, 29, 55;

%e 4, 67, 130, 193;

%e 5, 129, 253, 377, 501;

%e 6, 221, 436, 651, 866, 1081;

%e ...

%p A162615 := proc(n,k) n+(k-1)*(n^3-1) ; end proc: seq(seq(A162615(n,k),k=1..n),n=1..15) ; # _R. J. Mathar_, Feb 05 2010

%t Flatten[Table[c=n^3-1;NestList[#+c&,n,n-1],{n,10}]] (* _Harvey P. Dale_, Nov 13 2011 *)

%Y Cf. A000583, A068601, A159797, A162609, A162610, A162611, A162612, A162613, A162614, A162616.

%K easy,nonn,tabl

%O 1,2

%A _Omar E. Pol_, Jul 12 2009

%E Terms beyond the 6th row from _R. J. Mathar_ and _Max Alekseyev_, Feb 05 2010

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 25 16:45 EDT 2024. Contains 371989 sequences. (Running on oeis4.)