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.

A000135 Number of partitions into non-integral powers.

Original entry on oeis.org

1, 2, 6, 13, 24, 42, 73, 125, 204, 324, 511, 801, 1228, 1856, 2780, 4135, 6084, 8873, 12847, 18481, 26416, 37473, 52871, 74216, 103596, 143841, 198839, 273654, 374987, 511735, 695559, 941932, 1271139, 1709474, 2291195, 3061385, 4078152, 5416322
Offset: 1

Views

Author

Keywords

Comments

a(n) counts the solutions to the inequality sum_{i=1,2,..} x_i^(2/3)<=n for any number of distinct integers 1<=x_1R. J. Mathar, Jul 03 2009

Examples

			For n=3, the 6 solutions are (i) 1^(2/3)<=3. (ii) 1^(2/3)+2^(2/3)<=3. (iii) 2^(2/3)<=3. (iv) 3^(2/3)<=3. (v) 4^(2/3)<=3. (vi) 5^(2/3)<=3. - _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).

Crossrefs

Extensions

8 more terms from R. J. Mathar, Jul 03 2009
20 more terms from Sean A. Irvine, Sep 28 2009