|
|
A001422
|
|
Numbers which are not the sum of distinct squares.
|
|
29
|
|
|
2, 3, 6, 7, 8, 11, 12, 15, 18, 19, 22, 23, 24, 27, 28, 31, 32, 33, 43, 44, 47, 48, 60, 67, 72, 76, 92, 96, 108, 112, 128
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
This is the complete list (Sprague).
|
|
REFERENCES
|
S. Lin, Computer experiments on sequences which form integral bases, pp. 365-370 of J. Leech, editor, Computational Problems in Abstract Algebra. Pergamon, Oxford, 1970.
Harry L. Nelson, The Partition Problem, J. Rec. Math., 20 (1988), 315-316.
J. Roberts, Lure of the Integers, Math. Assoc. America, 1992, p. 222.
|
|
LINKS
|
R. E. Dressler and T. Parker, 12,758, Math. Comp. 28 (1974), 313-314.
|
|
FORMULA
|
|
|
MATHEMATICA
|
nn=50; t=Rest[CoefficientList[Series[Product[(1+x^(k*k)), {k, nn}], {x, 0, nn*nn}], x]]; Flatten[Position[t, 0]] (* T. D. Noe, Jul 24 2006 *)
|
|
PROG
|
(PARI) select( is_A001422(n, m=n)={m^2>n&& m=sqrtint(n); n!=m^2&&!while(m>1, isSumOfSquares(n-m^2, m--)&&return)}, [1..128]) \\ M. F. Hasler, Apr 21 2020
|
|
CROSSREFS
|
Cf. A025524 (number of numbers not the sum of distinct n-th-order polygonal numbers)
Cf. A007419 (largest number not the sum of distinct n-th-order polygonal numbers)
Cf. A053614, A121405 (corresponding sequences for triangular and pentagonal numbers)
|
|
KEYWORD
|
nonn,fini,full
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|