|
Search: id:A074396
|
|
|
| A074396 |
|
a(n) = 10 - (p mod 10), where p is the n-th prime congruent to 1 (mod 4) for which p+2 is also prime. |
|
+0
1
|
|
| 5, 3, 1, 9, 9, 3, 1, 3, 1, 9, 9, 9, 1, 3, 9, 1, 9, 3, 9, 1, 9, 1, 3, 1, 9, 9, 3, 9, 3, 1, 3, 9, 1, 9, 3, 1, 9, 1, 3, 1, 1, 9, 1, 3, 1, 1, 9, 3, 9, 9, 3, 1, 9, 1, 3, 3, 1, 9, 3, 9, 9, 3, 3, 1, 9, 1, 9, 3, 9, 3, 9, 3, 9, 1, 1, 3, 1, 1, 1, 1, 9, 9, 1, 1, 3, 1, 3, 3, 1, 1, 1, 3, 3, 3, 9, 1, 9, 9, 9, 3, 9, 1, 3, 3, 1
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
EXAMPLE
|
The first 5 such primes are 5, 17, 29, 41, 101. For these, 10 - (p mod 10) is 5, 3, 1, 9, 9.
|
|
MATHEMATICA
|
10-Mod[ #, 10]&/@Select[Prime/@Range[1500], PrimeQ[ #+2]&&Mod[ #, 4]==1&]
|
|
CROSSREFS
|
Cf. A071695.
Sequence in context: A092140 A011363 A021192 this_sequence A115991 A114344 A088324
Adjacent sequences: A074393 A074394 A074395 this_sequence A074397 A074398 A074399
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Roger L. Bagula (rlbagulatftn(AT)yahoo.com), Sep 24 2002
|
|
EXTENSIONS
|
Edited by Dean Hickerson (dean(AT)math.ucdavis.edu), Oct 09 2002
|
|
|
Search completed in 0.002 seconds
|
