|
|
A202940
|
|
Positive numbers n such that n is not a multiple of 10 and n^3 has at most three different digits.
|
|
1
|
|
|
1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 14, 15, 36, 62, 92, 101, 173, 192, 211, 888, 1001, 3543, 10001, 100001, 110011, 146796, 1000001, 10000001, 100000001
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
Subsequence of A030294 where trailing zeros are allowed.
Conjecture: no more terms other than those of the form 10^n+1, n=0,1,2,... .
|
|
LINKS
|
|
|
MATHEMATICA
|
Select[Range[150000], Mod[#, 10]!=0&&Count[DigitCount[#^3], 0]>6&] (* The program generates the first 26 terms of the sequience. To generate more, increase the Range constant but the program may take a long time to run. *) (* Harvey P. Dale, Sep 04 2021 *)
|
|
PROG
|
(PARI)
for(n=1, 10^9+1, if((n%10!=0) && #Set(digits(n^3))<=3, print1(n, ", ")));
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,base,more
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|