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!)
A099472 Numbers n such that binomial(n,m) cannot be represented as the sum of three squares for any 0 <= m <= n. 1
1, 2, 3, 4, 5, 9, 14, 17, 18, 20, 21, 35, 41 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
Andrew Granville and Yiliang Zhu, Representing binomial coefficients as sums of squares, Amer. Math. Monthly, Vol. 97, No. 6 (1990), 486-493.
MATHEMATICA
NoRepAs3Sqrs[n_] := Module[{e2}, e2=IntegerExponent[n, 2]; If[EvenQ[e2], 7==Mod[n/2^e2, 8], False]]; Select[Range[200], {}==Flatten[Position[Table[NoRepAs3Sqrs[Binomial[ #, m]], {m, #}], True]]&]
CROSSREFS
Cf. A004215 (sums of 4 but no fewer nonzero squares), A099473.
Sequence in context: A217376 A050160 A230769 * A191321 A222432 A222433
KEYWORD
fini,full,nonn
AUTHOR
T. D. Noe, Oct 18 2004
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 28 17:10 EDT 2024. Contains 372091 sequences. (Running on oeis4.)