Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #9 Aug 23 2018 05:46:28
%S 1,8,27,64,2744,729,2197,17576,19683,6859,148877,287496,438976,778688,
%T 2299968,3869893,43986977,75686967,174676879,596947688,796597983,
%U 1693669888,9649992689,56888939736,7598896696,78898389569,197747699976
%N Let k = n-th number that is a possible digit-sum for a cube (A054966); sequence gives smallest cube with digit-sum k.
%D Amarnath Murthy, Fabricating a perfect cube with a given valid digit sum (to be published)
%F a(n) = A067177(n)^3. - _R. J. Mathar_, Aug 23 2018
%e a(5) =2744, sum of digits = 17, the fifth term of A054966 (1,8,9,10,17,18...)
%Y Cf. A054966.
%K nonn,base
%O 0,2
%A _Amarnath Murthy_, Apr 19 2001
%E More terms from _Sascha Kurz_, Jan 28 2003