This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A162624 #12 Apr 28 2022 17:02:34 %S A162624 1,17,32,83,163,243,259,514,769,1024,629,1253,1877,2501,3125,1301, %T A162624 2596,3891,5186,6481,7776,2407,4807,7207,9607,12007,14407,16807,4103, %U A162624 8198,12293,16388,20483,24578,28673,32768,6569,13129,19689,26249,32809 %N A162624 Triangle read by rows in which row n lists n terms, starting with n^4 + n - 1, such that the difference between successive terms is equal to n^4 - 1 = A123865(n). %C A162624 Note that the last term of the n-th row is the 5th power of n, A000584(n). %C A162624 See also the triangles of A162622 and A162623. %H A162624 Nathaniel Johnston, <a href="/A162624/b162624.txt">Table of n, a(n) for n = 1..10000</a> %F A162624 Row sums: n*(n^5 + n^4 + n - 1)/2. - _R. J. Mathar_, Jul 20 2009 %e A162624 Triangle begins: %e A162624 1; %e A162624 17, 32; %e A162624 83, 163, 243; %e A162624 259, 514, 769, 1024; %e A162624 629, 1253, 1877, 2501, 3125; %e A162624 1301, 2596, 3891, 5186, 6481, 7776; %e A162624 ... %p A162624 A162624 := proc(n,k) return n+k*(n^4-1): end: seq(seq(A162624(n,k), k=1..n), n=1..10); # _Nathaniel Johnston_, Apr 30 2011 %t A162624 Table[NestList[#+n^4-1&,n^4+n-1,n-1],{n,10}]//Flatten (* _Harvey P. Dale_, Apr 28 2022 *) %Y A162624 Cf. A000584, A123865, A159797, A162609, A162610, A162611, A162612, A162613, A162614, A162615, A162616, A162622, A162623. %K A162624 easy,nonn,tabl %O A162624 1,2 %A A162624 _Omar E. Pol_, Jul 12 2009