login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A061096 Let k = n-th number that is a possible digit-sum for a cube (A054966); sequence gives smallest cube with digit-sum k. 1
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 (list; graph; refs; listen; history; internal format)
OFFSET

0,2

REFERENCES

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

LINKS

M. L. Perez et al., eds., Smarandache Notions Journal

EXAMPLE

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

CROSSREFS

Cf. A054966.

Sequence in context: A018832 A030293 A030479 * A084825 A193006 A166867

Adjacent sequences:  A061093 A061094 A061095 * A061097 A061098 A061099

KEYWORD

nonn,base

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Apr 19 2001

EXTENSIONS

More terms from Sascha Kurz (sascha.kurz(AT)uni-bayreuth.de), Jan 28 2003

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 14 01:35 EST 2012. Contains 205567 sequences.