login
This site is supported by donations to The OEIS Foundation.

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A155547 a(n) = prime(n) without prime digits in n. 1
2, 7, 13, 19, 23, 29, 31, 43, 53, 61, 67, 173, 179, 193, 199, 223, 227, 281, 283, 311, 317, 337, 347, 409, 419, 433, 443, 457, 461, 463, 467, 491, 503, 521, 523, 541, 547, 569, 577, 593, 599, 601, 607, 619, 641, 647, 653, 809, 811, 827, 839, 857, 859, 941, 947 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

Prime digit = 2, 3, 5 or 7.

LINKS

Table of n, a(n) for n=1..55.

FORMULA

a(n) = A000040(A084984(n)). - R. J. Mathar, Jan 25 2009

MAPLE

isA084984 := proc(n) local dgs ; dgs := convert(convert(n, base, 10), set) ; if dgs intersect {2, 3, 5, 7} <> {} then false; else true; fi; end: A084984 := proc(n) option remember ; local a ; if n = 1 then 1; else for a from procname(n-1)+1 do if isA084984(a) then RETURN(a) ; fi; od; fi; end: A155547 := proc(n) ithprime(A084984(n)) ; end: for n from 1 to 80 do printf("%d, ", A155547(n)) ; od: # R. J. Mathar, Jan 25 2009

CROSSREFS

Cf. A000027, A000040.

Sequence in context: A209886 A168465 A140562 * A007821 A156007 A067774

Adjacent sequences:  A155544 A155545 A155546 * A155548 A155549 A155550

KEYWORD

nonn,base

AUTHOR

Juri-Stepan Gerasimov, Jan 24 2009

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 15 20:00 EST 2019. Contains 330000 sequences. (Running on oeis4.)