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!)
A259059 One half of numbers representable in at least two different ways as sums of four distinct nonvanishing squares. See A259058 for these numbers and their representations. 2
227, 265, 307, 353, 403, 457, 515, 577, 643, 713, 787, 865, 947, 1033, 1123, 1217, 1315, 1417, 1523, 1633, 1747, 1865, 1987, 2113, 2243, 2377, 2515, 2657, 2803, 2953, 3107, 3265, 3427, 3593, 3763, 3937, 4115, 4297, 4483, 4673, 4867, 5065, 5267, 5473 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,1
COMMENTS
There may be other numbers with this property.
REFERENCES
W. Sierpiński, 250 Problems in Elementary Number Theory, American Elsevier Publ. Comp., New York, PWN-Polish Scientific Publishers, Warszawa, 1970, Problem 227, p. 20 and p. 110.
LINKS
FORMULA
a(n) = A259058(n)/2.
a(n) = 2*n^2 + 36*n + 227.
O.g.f.: (227 - 416*x + 193*x^2)/(1-x)^3.
a(n) = 3*a(n-1)-3*a(n-2)+a(n-3). - Vincenzo Librandi, Aug 13 2015
MAPLE
A259059:=n->2*n^2 + 36*n + 227: seq(A259059(n), n=0..50); # Wesley Ivan Hurt, Aug 13 2015
MATHEMATICA
CoefficientList[Series[(227 - 416 x + 193 x^2)/(1 - x)^3, {x, 0, 50}], x] (* Vincenzo Librandi, Aug 13 2015 *)
PROG
(Magma) [2*n^2+36*n+227: n in [0..50]] /* or */ I:=[227, 265, 307]; [n le 3 select I[n] else 3*Self(n-1)-3*Self(n-2)+Self(n-3): n in [1..50]]; // Vincenzo Librandi, Aug 13 2015
(PARI) a(n)=2*n^2+36*n+227 \\ Charles R Greathouse IV, Jun 17 2017
CROSSREFS
Cf. A259058.
Sequence in context: A031513 A078765 A179141 * A333425 A142261 A117458
KEYWORD
nonn,easy
AUTHOR
Wolfdieter Lang, Aug 12 2015
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 25 04:42 EDT 2024. Contains 371964 sequences. (Running on oeis4.)