cp's OEIS Frontend

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).

%I A162615 #14 Feb 21 2024 08:19:07
%S A162615 1,2,9,3,29,55,4,67,130,193,5,129,253,377,501,6,221,436,651,866,1081,
%T A162615 7,349,691,1033,1375,1717,2059,8,519,1030,1541,2052,2563,3074,3585,9,
%U A162615 737,1465,2193,2921,3649,4377,5105,5833,10,1009,2008,3007,4006,5005,6004
%N 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).
%C A162615 See also the triangles of A162614 and A162616.
%H A162615 Harvey P. Dale, <a href="/A162615/b162615.txt">Table of n, a(n) for n = 1..10000</a>
%F A162615 Row sums: n*(n^4 - n^3 + n + 1)/2. - _R. J. Mathar_, Jul 20 2009
%e A162615 Triangle begins:
%e A162615   1;
%e A162615   2,   9;
%e A162615   3,  29,  55;
%e A162615   4,  67, 130, 193;
%e A162615   5, 129, 253, 377, 501;
%e A162615   6, 221, 436, 651, 866, 1081;
%e A162615   ...
%p A162615 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 A162615 Flatten[Table[c=n^3-1;NestList[#+c&,n,n-1],{n,10}]] (* _Harvey P. Dale_, Nov 13 2011 *)
%Y A162615 Cf. A000583, A068601, A159797, A162609, A162610, A162611, A162612, A162613, A162614, A162616.
%K A162615 easy,nonn,tabl
%O A162615 1,2
%A A162615 _Omar E. Pol_, Jul 12 2009
%E A162615 Terms beyond the 6th row from _R. J. Mathar_ and _Max Alekseyev_, Feb 05 2010