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

A202101
Numbers n such that 90*n + 59 is prime.
10
0, 1, 2, 4, 5, 6, 11, 13, 14, 15, 16, 21, 22, 23, 25, 26, 28, 32, 34, 35, 36, 37, 40, 43, 44, 47, 51, 54, 55, 56, 57, 58, 62, 67, 69, 70, 71, 74, 76, 78, 81, 83, 89, 93, 95, 96, 99, 100, 102, 104, 107, 112, 116, 117, 120, 121, 126, 127, 128, 132, 134, 138
OFFSET
1,3
COMMENTS
This sequence was generated by adding 12 Fibonacci-like sequences (see: PROG]. Looking at 90n+59 modulo 9 and modulo 10 we see that all entries of A142319 have digital root 5 and last digit 9. (Reverting the process is an application of the Chinese remainder theorem)
MATHEMATICA
Select[Range[0, 200], PrimeQ[90 # + 59] &]
PROG
(PARI) is(n)=isprime(90*n+59) \\ Charles R Greathouse IV, Feb 17 2017
KEYWORD
nonn,easy
AUTHOR
J. W. Helkenberg, Dec 11 2011
STATUS
approved