OFFSET
1,1
COMMENTS
This sequence has 138 terms.
LINKS
Nathaniel Johnston, Table of n, a(n) for n = 1..138 (full sequence)
EXAMPLE
2358828^3 = 13124683009764879552, which contains each digit 0..9 exactly twice.
MAPLE
lim:=floor((10^20)^(1/3)): for j from ceil((10^19)^(1/3)) to lim do d:=convert(j^3, base, 10): doubdig:=true: for k from 0 to 9 do if(numboccur(d, k)<>2)then doubdig:=false:break: fi: od: if(doubdig)then print(j); fi: od: # Nathaniel Johnston, May 28 2011
MATHEMATICA
With[{cmin=Ceiling[Surd[10^19, 3]], cmax=Floor[Surd[10^20, 3]]}, Select[ Range[ cmin, cmax], Union[ DigitCount[#^3]]=={2}&]] (* Harvey P. Dale, Nov 17 2018 *)
CROSSREFS
KEYWORD
base,easy,fini,full,nonn
AUTHOR
Zhining Yang, Jan 16 2009
STATUS
approved