OFFSET
1,1
COMMENTS
The number of decimal digits of a(n) is never divisible by 3. - Robert Israel, May 22 2014
The smallest prime using only all three straight digits is a(9) = 1447 (see Prime Curios! link). - Bernard Schott, Sep 08 2023
LINKS
Robert Israel, Table of n, a(n) for n = 1..10000
Chris K. Caldwell and G. L. Honaker, Jr., 1447, Prime Curios! [Gupta]
EXAMPLE
17 is a term because it is a prime and consists of straight digits 1 and 7 only.
MAPLE
f:= proc(x) local n, d, t, i, a;
n:= floor(log[3]((2*x+3)));
if n mod 3 = 0 then return 0 fi;
d:=x - (3^n - 3)/2;
t:= 0;
for i from 0 to n-1 do
a:= d mod 3;
t:= t + (3*a+1)*10^i;
d:= (d-a)/3;
od:
t
end proc:
select(isprime, map(f, [$1..1000])); # Robert Israel, May 22 2014
MATHEMATICA
Select[Prime[Range[2000]], Union[ Join[ IntegerDigits[ # ], {1, 4, 7}]] == {1, 4, 7} &]
PROG
(PARI) straight(n)=my(t); while(n, t=n%10; if(t!=1&&t!=4&&t!=7, return(0)); n\=10); !!t
select(straight, primes(1000)) \\ Charles R Greathouse IV, Sep 25 2012
CROSSREFS
KEYWORD
base,nonn
AUTHOR
Shyam Sunder Gupta, Jan 23 2003
EXTENSIONS
Corrected and extended by Robert G. Wilson v, Jan 24 2003
STATUS
approved