cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A095809 Least positive number having exactly n partitions into three squares.

Original entry on oeis.org

1, 9, 41, 81, 146, 194, 306, 369, 425, 594, 689, 866, 1109, 1161, 1154, 1361, 1634, 1781, 1889, 2141, 2729, 2609, 3626, 3366, 3566, 3449, 3506, 4241, 4289, 4826, 5066, 5381, 7034, 5561, 6254, 7229, 7829, 8186, 8069, 8126, 8609, 8921, 8774, 10386
Offset: 1

Views

Author

T. D. Noe, Jun 07 2004

Keywords

Comments

Note that a square can be zero.

Examples

			41 is the least number having three partitions: 41 = 0+16+25 = 1+4+36 = 9+16+16.
		

Crossrefs

Apart from initial term, same as A000437.
Cf. A094739 (n having a unique partition into three squares), A095811 (greatest number having exactly n partitions into three squares), A124970.

Programs

  • Mathematica
    lim=200; nLst=Table[0, {lim^2}]; Do[n=a^2+b^2+c^2; If[n>0 && n