|
|
A202114
|
|
Numbers n such that 90n + 53 is prime.
|
|
3
|
|
|
0, 2, 5, 6, 7, 8, 9, 10, 13, 16, 17, 24, 26, 29, 30, 31, 33, 35, 42, 43, 44, 47, 48, 49, 51, 52, 55, 58, 64, 65, 68, 69, 70, 75, 77, 80, 82, 83, 85, 86, 87, 91, 93, 94, 96, 97, 99, 103, 104, 112, 113, 114, 120, 124, 126, 127, 132, 134, 135, 138, 140, 141
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
This sequence was generated by adding 12 Fibonacci-like sequences [See: PROG]. Looking at the format 90n+53 modulo 9 and modulo 10 we see that all entries of A142316 have digital root 8 and last digit 3. (Reverting the process is an application of the Chinese remainder theorem.) The 12 Fibonacci-like sequences are generated (via the p and q "seed" values entered into the PERL program) from the base p,q pairs 53*91, 19*17, 37*89, 73*71, 11*13, 29*67, 47*49, 83*31, 23*61, 41*43, 59*7, 77*79.
|
|
LINKS
|
|
|
MATHEMATICA
|
Select[Range[0, 200], PrimeQ[90 # + 53] &]
|
|
PROG
|
|
|
CROSSREFS
|
Cf. A181732, A198382, A195993, A196000, A196007, A201739, A201734, A201804, A201816, A201817, A201818, A201820, A201822, A202101, A202104, A202105, A202110, A202112, A202113.
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|