OFFSET
1,1
COMMENTS
Numbers n such that (290*10^n + 61)/9 is prime.
Numbers n such that digit 3 followed by n >= 0 occurrences of digit 2 followed by digit 9 is prime.
a(19) > 10^5. - Robert Price, Apr 05 2015
REFERENCES
Klaus Brockhaus and Walter Oberschelp, Zahlenfolgen mit homogenem Ziffernkern, MNU 59/8 (2006), pp. 462-467.
LINKS
FORMULA
a(n) = A102968(n) - 1.
EXAMPLE
3229 is prime, hence 2 is a term.
MATHEMATICA
Select[Range[0, 1000], PrimeQ[(290*10^# + 61)/9] &] (* Robert Price, Apr 05 2015 *)
PROG
(PARI) a=39; for(n=0, 1500, if(isprime(a), print1(n, ", ")); a=10*a-61)
(PARI) for(n=0, 1500, if(isprime((290*10^n+61)/9), print1(n, ", ")))
(Magma) [n: n in [0..500] | IsPrime((290*10^n+61) div 9)]; // Vincenzo Librandi, Apr 06 2015
CROSSREFS
KEYWORD
nonn,hard,more
AUTHOR
Klaus Brockhaus and Walter Oberschelp (oberschelp(AT)informatik.rwth-aachen.de), Dec 20 2004
EXTENSIONS
More terms from Herman Jamke (hermanjamke(AT)fastmail.fm), Jan 02 2008
a(15)-a(18) derived from A102968 by Robert Price, Apr 05 2015
STATUS
approved