|
|
A134754
|
|
Minimal number such that all greater numbers can be written as sums of squares >1 in more than n ways.
|
|
6
|
|
|
23, 39, 39, 55, 55, 55, 59, 59, 63, 71, 71, 71, 71, 75, 75, 75, 75, 79, 79, 87, 87, 87, 87, 87, 91, 91, 91, 91, 91, 91, 95, 95, 95, 95, 95, 96, 96, 99, 99, 103, 103, 103, 103, 103, 103, 103, 107, 107, 107, 107, 107, 107, 107, 107, 111, 111, 111, 111, 111, 111, 111
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,1
|
|
COMMENTS
|
The sequence is well-defined, in that a(n) exists for all n>=0. For the reasoning see A078134.
|
|
LINKS
|
|
|
FORMULA
|
a(n)=min( m | A078134(j)>n for all j>m).
|
|
EXAMPLE
|
a(0)=23, since numbers >23 can be written as sum of squares >1.
a(2)=39, since there are at least three ways, to write a number >39 as a sum of squares >1.
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|