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”).
%I #2 Mar 30 2012 17:37:48
%S 15538734736,28034367522,41221375552,89468493268,92220460962,
%T 95951017078,105627706800,108012908976,147689513538,161055865908,
%U 177073756566,181921823202,185137153012,192336309046,212463686778
%N Numbers m such that all ten numbers 10^k*m+1; k=0,1,...,9 are prime.
%C If m & n are in the sequence, k<10 and r=m*n*10^k -1 is prime then r has
%C at least k+1 representations of the form p*q-(p+q)where p & q are prime.
%H Carlos Rivera, <a href="http://www.primepuzzles.net/puzzles/puzz_482.htm">Two Bergot questions</a>
%Y Cf. A153431, A153433.
%K nonn
%O 1,1
%A _Farideh Firoozbakht_, Mar 31 2009