cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A202940 Positive numbers n such that n is not a multiple of 10 and n^3 has at most three different digits.

This page as a plain text file.
%I A202940 #20 Sep 04 2021 12:57:17
%S A202940 1,2,3,4,5,6,7,8,9,11,14,15,36,62,92,101,173,192,211,888,1001,3543,
%T A202940 10001,100001,110011,146796,1000001,10000001,100000001
%N A202940 Positive numbers n such that n is not a multiple of 10 and n^3 has at most three different digits.
%C A202940 Subsequence of A030294 where trailing zeros are allowed.
%C A202940 Conjecture: no more terms other than those of the form 10^n+1, n=0,1,2,... .
%t A202940 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 *)
%o A202940 (PARI)
%o A202940 for(n=1,10^9+1, if((n%10!=0) && #Set(digits(n^3))<=3, print1(n,", ")));
%o A202940 \\ _Joerg Arndt_, Dec 13 2014
%Y A202940 Cf. A030294.
%K A202940 nonn,base,more
%O A202940 1,2
%A A202940 _Zak Seidov_, Dec 26 2011