|
%I #4 Mar 31 2012 13:21:04
%S 23,39,39,55,55,55,59,59,63,71,71,71,71,75,75,75,75,79,79,87,87,87,87,
%T 87,91,91,91,91,91,91,95,95,95,95,95,96,96,99,99,103,103,103,103,103,
%U 103,103,107,107,107,107,107,107,107,107,111,111,111,111,111,111,111
%N Minimal number such that all greater numbers can be written as sums of squares >1 in more than n ways.
%C The sequence is well-defined, in that a(n) exists for all n>=0. For the reasoning see A078134.
%F a(n)=min( m | A078134(j)>n for all j>m).
%e a(0)=23, since numbers >23 can be written as sum of squares >1.
%e a(2)=39, since there are at least three ways, to write a number >39 as a sum of squares >1.
%Y Cf. A078134, A078135, A078136, A090677, A078137, A134755.
%K nonn
%O 0,1
%A _Hieronymus Fischer_, Nov 11 2007
|
