login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A294741 Numbers that are the sum of 5 nonzero squares in exactly 7 ways. 2
77, 83, 85, 88, 94, 99, 120, 124, 130, 137, 138, 150, 156, 201 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
Theorem: There are no further terms. Proof (from a proof by David A. Corneth on Nov 08 2017 in A294736): The von Eitzen link states that if n > 5408 then the number of ways to write n as a sum of 5 squares is at least floor(sqrt(n - 101) / 8) = 9. For n <= 5408, terms have been verified by inspection. Hence this sequence is finite and complete.
REFERENCES
E. Grosswald, Representations of Integers as Sums of Squares. Springer-Verlag, New York, 1985, p. 86, Theorem 1.
LINKS
H. von Eitzen, in reply to user James47, What is the largest integer with only one representation as a sum of five nonzero squares? on stackexchange.com, May 2014
D. H. Lehmer, On the Partition of Numbers into Squares, The American Mathematical Monthly, Vol. 55, No. 8, October 1948, pp. 476-481.
Eric Weisstein's World of Mathematics, Square Number.
MATHEMATICA
fQ[n_] := Block[{pr = PowersRepresentations[n, 5, 2]}, Length@Select[pr, #[[1]] > 0 &] == 7]; Select[Range@250, fQ] (* Robert G. Wilson v, Nov 17 2017 *)
CROSSREFS
Sequence in context: A217545 A344799 A344800 * A052202 A089525 A274172
KEYWORD
nonn,fini,full
AUTHOR
Robert Price, Nov 07 2017
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 19 19:02 EDT 2024. Contains 371798 sequences. (Running on oeis4.)