|
%I #13 Dec 04 2020 17:56:42
%S 1,2,1,5,1,7,14,6,15,25,11,23,36,14,29,45,13,31,50,6,27,49,72,15,40,
%T 66,93,21,50,80,111,22,55,89,124,16,53,91,130,1,42,84,127,171,20,66,
%U 113,161,210,35,86,138,191,245,44,100,157,215,274,45,106,168,231,295,36
%N Fill a triangular array by rows by writing numbers 1, then 1 up to 2^2, then 1 up to 3^2, then 1 up to 4^2 and so on. The final elements of the rows form the sequence.
%C Does every number appear at least once? Do some numbers like 1 appear infinitely often? - _Robert G. Wilson v_, Oct 10 2001
%C Difference between n-th triangular number and largest square pyramidal number (A000330) less than it. - _Franklin T. Adams-Watters_, Sep 11 2006
%H Alois P. Heinz, <a href="/A064865/b064865.txt">Table of n, a(n) for n = 1..10000</a>
%F a(n) = n(n+1)/2 - max_{p(m) < n(n+1)/2} p(m), where p(m) = m(m+1)(2m+1)/6. - _Franklin T. Adams-Watters_, Sep 11 2006
%e The triangle begins:
%e ....1
%e ...1.2
%e ..3.4.1
%e .2.3.4.5
%e 6.7.8.9.1
%t a = {}; Do[a = Append[a, Table[i, {i, 1, n^2} ]], {n, 1, 100} ]; a = Flatten[a]; Do[Print[a[[n(n + 1)/2]]], {n, 1, 100} ]
%t With[{nn=20},TakeList[Flatten[Table[Range[n^2],{n,nn}]],Range[Floor[ (Sqrt[8*nn^3+12*nn^2+4*nn+3]/Sqrt[3]-1)/2]]]][[All,-1]] (* Requires Mathematica version 10 or later *) (* _Harvey P. Dale_, Dec 04 2020 *)
%Y Table: A064866.
%Y Cf. A000217, A000330.
%K easy,nonn
%O 1,2
%A _Floor van Lamoen_, Oct 08 2001
%E More terms from _Robert G. Wilson v_, Oct 10 2001
|
