A107625 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A107625

Every digit of prime and its index contains a loop (only digits 0,4,6,8,9 in prime and its index).

409, 4409, 4999, 6869, 44699, 44909, 46499, 48409, 64849, 66889, 68449, 68909, 86969, 89689, 98869, 98899, 480499, 488689, 490499, 609809, 806609, 806999, 866969, 868669, 868849, 869489, 869849, 869899, 869909, 880949, 6440809, 6440999, 6488969, 6489449

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,1

COMMENTS

Corresponding indices in A107624. Cf. A001744 Every digit contains a loop.

LINKS

Harvey P. Dale, Table of n, a(n) for n = 1..376

MATHEMATICA

Do[id=Union[IntegerDigits[p=Prime[n]], IntegerDigits[n]]; If[Count[id, 1]+Count[id, 2]+Count[id, 3]+Count[id, 5]+Count[id, 7]==0, Print[p]], {n, 10000}]

Module[{c={0, 4, 6, 8, 9}}, Select[Prime/@(Rest[FromDigits/@Tuples[c, 6]]), SubsetQ[ c, IntegerDigits[#]]&]] (* Harvey P. Dale, Sep 03 2015 *)

PROG

(PARI) is_a001744(n) = #setintersect(vecsort(digits(n), , 8), [1, 2, 3, 5, 7])==0

my(i=1); forprime(p=1, 65e5, if(is_a001744(p) && is_a001744(i), print1(p, ", ")); i++) \\ Felix Fröhlich, Sep 09 2019

CROSSREFS

Cf. A001744, A107624.

Sequence in context: A052376 A201483 A031601 * A061333 A262636 A238753

Adjacent sequences: A107622 A107623 A107624 * A107626 A107627 A107628

KEYWORD

nonn,base,dumb

AUTHOR

Zak Seidov, May 18 2005

EXTENSIONS

More terms from Harvey P. Dale, Sep 03 2015

STATUS

approved