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

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, 67, 94, 22, 51, 81, 112, 23, 56, 90, 125, 17, 54, 92, 131, 2, 43, 85, 128, 172, 21, 67, 114, 162, 211, 36, 87, 139, 192, 246, 45, 101, 158, 216, 275, 46, 107, 169, 232, 296, 37

Offset: 0

Author

Floor van Lamoen, Oct 22 2001

Keywords

• easy
• nonn

Links

• Alois P. Heinz, Table of n, a(n) for n = 0..10000

Crossrefs

Mini-index to these sequences: A064766, A064865, A064866, A065221-A655234 are all of the same type. See A064766 for a detailed explanation.