A258264 Numbers having only one representation as a sum of the minimal number of triangular numbers, A000217.
1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 18, 20, 21, 22, 24, 25, 27, 28, 29, 30, 34, 36, 37, 38, 39, 43, 45, 48, 49, 50, 53, 55, 57, 58, 60, 61, 64, 65, 66, 67, 69, 70, 73, 78, 79, 83, 84, 87, 88, 90, 91, 92, 93, 97, 99, 100, 101, 102, 105, 108, 110
Offset: 1
Keywords
Links
- Giovanni Resta, Table of n, a(n) for n = 1..10000
Programs
-
Mathematica
t[n_] := n (n + 1)/2; ok[n_] := Block[{k = 1, t, tt = t /@ Range[ Sqrt[2*n]]}, While[{} == (r = IntegerPartitions[n, {k}, tt]), k++]; Length@ r == 1]; Select[Range[100], ok]
Comments