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.

A061096 Let k = n-th number that is a possible digit-sum for a cube (A054966); sequence gives smallest cube with digit-sum k.

Original entry on oeis.org

1, 8, 27, 64, 2744, 729, 2197, 17576, 19683, 6859, 148877, 287496, 438976, 778688, 2299968, 3869893, 43986977, 75686967, 174676879, 596947688, 796597983, 1693669888, 9649992689, 56888939736, 7598896696, 78898389569, 197747699976, 677298787768, 1778597976896
Offset: 0

Views

Author

Amarnath Murthy, Apr 19 2001

Keywords

Examples

			a(5) = 2744, sum of digits = 17, the fifth term of A054966 (1,8,9,10,17,18...)
		

References

  • Amarnath Murthy, Fabricating a perfect cube with a given valid digit sum (to be published)

Crossrefs

Formula

a(n) = A067177(n)^3. - R. J. Mathar, Aug 23 2018

Extensions

More terms from Sascha Kurz, Jan 28 2003