|
|
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;
text;
internal format)
|
|
|
OFFSET
|
0,2
|
|
REFERENCES
|
Amarnath Murthy, Fabricating a perfect cube with a given valid digit sum (to be published)
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
a(5) =2744, sum of digits = 17, the fifth term of A054966 (1,8,9,10,17,18...)
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,base
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|