cp's OEIS Frontend

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.

A162623 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^4 - 1 = A123865(n).

This page as a plain text file.
%I A162623 #9 Apr 27 2019 02:33:39
%S A162623 1,2,17,3,83,163,4,259,514,769,5,629,1253,1877,2501,6,1301,2596,3891,
%T A162623 5186,6481,7,2407,4807,7207,9607,12007,14407,8,4103,8198,12293,16388,
%U A162623 20483,24578,28673,9,6569,13129,19689,26249,32809,39369,45929,52489,10
%N A162623 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^4 - 1 = A123865(n).
%C A162623 See also the triangles of A162622 and A162624.
%F A162623 Row sums: n*(n^5 - n^4 + n + 1)/2. - _R. J. Mathar_, Jul 20 2009
%e A162623 Triangle begins:
%e A162623   1;
%e A162623   2,   17;
%e A162623   3,   83,  163;
%e A162623   4,  259,  514,  769;
%e A162623   5,  629, 1253, 1877, 2501;
%e A162623   6, 1301, 2596, 3891, 5186, 6481;
%p A162623 A162623 := proc(n,k) n+k*(n^4-1) ; end: seq(seq(A162623(n,k),k=0..n-1),n=1..15) ; # _R. J. Mathar_, Sep 27 2009
%t A162623 dst[n_]:=Module[{c=n^4-1},Range[n,n*c,c]]; Flatten[Join[{1},Table[dst[n],{n,2,10}]]] (* _Harvey P. Dale_, Jul 29 2014 *)
%Y A162623 Cf. A000583, A000584, A123865, A159797, A162609, A162610, A162611, A162612, A162613, A162614, A162615, A162616, A162622, A162624.
%K A162623 easy,nonn,tabl
%O A162623 1,2
%A A162623 _Omar E. Pol_, Jul 12 2009
%E A162623 More terms from _R. J. Mathar_, Sep 27 2009