login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A000451 Smallest number that is the sum of 3 squares in at least n ways. 2
0, 9, 41, 81, 146, 194, 306, 369, 425, 594, 689, 866, 1109, 1154, 1154, 1361, 1634, 1781, 1889, 2141, 2609, 2609, 3366, 3366, 3449, 3449, 3506, 4241, 4289, 4826, 5066, 5381, 5561, 5561, 6254, 7229, 7829, 8069, 8069, 8126, 8609, 8774, 8774 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

T. D. Noe, Table of n, a(n) for n = 1..200

Index entries for sequences related to sums of squares

MATHEMATICA

nn = 100; lim = nn^2; t = Table[0, {lim}]; Do[k = x^2 + y^2 + z^2; If[0 < k <= lim, t[[k]]++], {x, 0, nn}, {y, x, nn}, {z, y, nn}]; u = Union[t]; c = Complement[Range[u[[-1]]], u]; If[c == {}, mx = u[[-1]], mx = c[[1]] - 1]; Join[{0}, Flatten[Table[Position[t, _?(# >= n &), 1, 1], {n, 2, mx}]]] (* T. D. Noe, Jun 20 2012 *)

CROSSREFS

Sequence in context: A159754 A045804 A198943 * A000437 A095809 A273359

Adjacent sequences:  A000448 A000449 A000450 * A000452 A000453 A000454

KEYWORD

nonn

AUTHOR

N. J. A. Sloane.

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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified June 27 11:25 EDT 2017. Contains 288788 sequences.