Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #12 Nov 01 2024 15:07:30
%S 1,1,3,2,6,2,8,15,7,16,1,12,24,1,15,30,46,14,32,51,7,28,50,73,16,41,
%T 67,94,22,51,81,112,23,56,90,125,17,54,92,131,2,43,85,128,172,21,67,
%U 114,162,211,36,87,139,192,246,45,101,158,216,275,46,107,169,232,296,37
%N Fill a triangular array by rows by writing numbers 1 up to b(0), 1 up to b(1), etc., where b(n) are the square numbers. The first elements of the rows form a(n).
%H Alois P. Heinz, <a href="/A065228/b065228.txt">Table of n, a(n) for n = 0..10000</a>
%Y Mini-index to these sequences: A064766, A064865, A064866, A065221-A655234 are all of the same type. See A064766 for a detailed explanation.
%K easy,nonn
%O 0,3
%A _Floor van Lamoen_, Oct 22 2001