|
| |
|
|
A202101
|
|
Numbers n such that 90*n + 59 is prime.
|
|
9
|
|
|
|
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
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
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)
|
|
|
LINKS
|
Table of n, a(n) for n=1..62.
|
|
|
MATHEMATICA
|
Select[Range[0, 200], PrimeQ[90 # + 59] &]
|
|
|
CROSSREFS
|
Cf. A181732, A198382, A195993, A196000, A196007, A201739, A201734, A201804, A201816, A201817, A201818, A201820, A201822.
Sequence in context: A165701 A129305 A113631 * A192582 A101951 A171166
Adjacent sequences: A202098 A202099 A202100 * A202102 A202103 A202104
|
|
|
KEYWORD
|
nonn,easy
|
|
|
AUTHOR
|
J. W. Helkenberg, Dec 11 2011
|
|
|
STATUS
|
approved
|
| |
|
|
