The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 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 Cf. A078134, A078135, A078136, A090677, A078137, A134755. Sequence in context: A146390 A233385 A282712 * A134755 A345277 A209985 Adjacent sequences:  A134751 A134752 A134753 * A134755 A134756 A134757 KEYWORD nonn AUTHOR Hieronymus Fischer, Nov 11 2007 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified September 25 11:34 EDT 2021. Contains 347654 sequences. (Running on oeis4.)