login

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”).

A244748
Numbers k such that (product of digits of k)^2 + 1 is prime.
2
1, 2, 4, 6, 11, 12, 14, 16, 21, 22, 23, 25, 27, 28, 32, 38, 41, 44, 45, 46, 49, 52, 54, 58, 61, 64, 66, 69, 72, 78, 82, 83, 85, 87, 94, 96, 111, 112, 114, 116, 121, 122, 123, 125, 127, 128, 132, 138, 141, 144, 145, 146, 149, 152, 154, 158, 161, 164, 166, 169, 172, 178, 182, 183
OFFSET
1,2
COMMENTS
A number k is a term of this sequence iff A007954(k)^2 is in A006093.
This sequence is infinite. With any number a(n), you can add infinitely many 1's to its decimal representation. E.g., 85 is in this sequence, so 185, 815, 851, 1185, 1815, 18115, etc. are terms as well.
LINKS
EXAMPLE
(7*2)^2 + 1 = 197 is prime. Thus 72 is a term of this sequence.
PROG
(PARI) for(n=1, 10^3, d=digits(n); if(ispseudoprime(prod(i=1, #d, d[i])^2+1), print1(n, ", ")))
CROSSREFS
Sequence in context: A097954 A324333 A081988 * A245017 A300149 A171921
KEYWORD
nonn,base,easy
AUTHOR
Derek Orr, Jul 12 2014
EXTENSIONS
Corrected by Jens Kruse Andersen, Jul 13 2014
STATUS
approved