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.

A000333 Number of partitions into non-integral powers.

Original entry on oeis.org

1, 5, 15, 40, 98, 237, 534, 1185, 2554, 5391, 11117, 22556, 44858, 88000, 170107, 324547, 611755, 1140382, 2103554, 3842826, 6955918, 12483075, 22220002, 39248230, 68819781, 119839422, 207304370, 356356801, 608901907, 1034452712, 1747764522, 2937370605, 4911675955, 8173032301
Offset: 1

Views

Author

Keywords

Comments

a(n) is the number of solutions to the inequality sum_{i=1,2,3...} x_i^(1/2)<=n under the constraint that x_i are integers where 1<=x_1<=x_2<=x_3<=x_4<=... [From R. J. Mathar, Jul 03 2009]

Examples

			a(n=3)=15 counts the solutions 1^(1/2)<=3, 1^(1/2)+1^(1/2)<=3, 1^(1/2)+1^(1/2)+1^(1/2)<=3, 1^(1/2)+2^(1/2)<=3, 1^(1/2)+3^(1/2)<=3, 1^(1/2)+4^(1/2)<=3, 2^(1/2)<=3, 2^(1/2)+2^(1/2)<=3, 3^(1/2)<=3, 4^(1/2)<=3,.., 8^(1/2)<=3 and 9^(1/2)<=3. [From _R. J. Mathar_, Jul 03 2009]
		

References

  • B. K. Agarwala and F. C. Auluck, Statistical mechanics and partitions into non-integral powers of integers, Proc. Camb. Phil. Soc., 47 (1951), 207-216.
  • N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
  • N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Extensions

2 more terms from R. J. Mathar, Jul 03 2009
More terms from Sean A. Irvine, Nov 14 2010