|
|
A201739
|
|
Numbers n such that 90*n + 29 is prime.
|
|
18
|
|
|
0, 4, 5, 6, 7, 9, 10, 11, 12, 14, 17, 23, 27, 28, 30, 31, 32, 33, 34, 37, 38, 39, 41, 44, 45, 47, 48, 53, 54, 61, 65, 70, 73, 74, 75, 76, 77, 80, 83, 84, 88, 89, 91, 96, 98, 100, 102, 105, 108, 109, 110, 114, 117, 119, 125, 126, 128, 132, 136, 139, 142, 143
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
This sequence was generated by adding 12 Fibonacci-like sequences. Looking at the format 90n+29 modulo 9 and modulo 10 we see that all entries of A142327 have digital root 2 and last digit 9. (Reverting the process is an application of the Chinese remainder theorem.)
|
|
LINKS
|
|
|
FORMULA
|
|
|
MAPLE
|
for n from 0 to 240 do
p := 90*n+29 ;
if isprime(p) then
printf("%d, ", n) ;
end if;
|
|
MATHEMATICA
|
|
|
PROG
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|