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

A202112
Numbers n such that 90n + 79 is prime.
6
0, 3, 4, 6, 7, 11, 13, 15, 17, 18, 19, 20, 24, 29, 33, 35, 36, 38, 41, 45, 46, 52, 56, 57, 60, 61, 62, 63, 64, 68, 70, 71, 75, 81, 82, 83, 84, 89, 90, 91, 94, 95, 96, 103, 104, 106, 111, 112, 115, 119, 122, 123, 124, 125, 129, 130, 132, 133, 137, 139, 146
OFFSET
1,2
COMMENTS
This sequence was generated by adding 14 Fibonacci-like sequences [See: PROG]. Looking at the format 90n+79 modulo 9 and modulo 10 we see that all entries of A142330 have digital root 7 and last digit 9. (Reverting the process is an application of the Chinese remainder theorem.) The 14 Fibonacci-like sequences are generated (via the p and q values given in the PERL program) from the base p,q pairs 79*91, 19*61, 37*7, 73*43, 11*89, 29*71, 47*17, 83*53, 13*13, 31*49, 67*67, 23*23, 41*59, 77*77.
FORMULA
a(n) ~ 24n log n. - Charles R Greathouse IV, Jun 01 2016
MATHEMATICA
Select[Range[0, 200], PrimeQ[90 # + 79] &]
PROG
(PARI) is(n)=n%90==79 && isprime(n) \\ Charles R Greathouse IV, Jun 01 2016
KEYWORD
nonn,easy
AUTHOR
J. W. Helkenberg, Dec 11 2011
STATUS
approved