|
Search: id:A139457
|
|
|
| A139457 |
|
a(n)= smallest m such that primorial(n)/2 + 2^m is prime. |
|
+0
24
|
|
| 1, 1, 1, 3, 1, 2, 4, 3, 1, 1, 1, 4, 10, 1, 11, 1, 2, 11, 14, 2, 8, 7, 3, 4, 4, 26, 21, 1, 4, 15, 10, 8, 4, 16, 29, 10, 3, 51, 17, 5, 12, 12, 48, 13, 45, 12, 1, 20, 17, 65, 12, 8, 95, 5, 12, 11, 8, 110, 38, 28, 8, 1, 23, 13, 5, 7, 11, 21, 2, 20, 32, 9, 66, 4, 2, 1, 20, 34, 97, 28, 80, 10, 65
(list; graph; listen)
|
|
|
OFFSET
|
1,4
|
|
|
MATHEMATICA
|
k = 1; a = {}; Do[k = k*Prime[n]; m = 1; While[ ! PrimeQ[k + 2^m], m++ ]; Print[m]; AppendTo[a, m], {n, 2, 200}]; a (*Artur Jasinski*)
|
|
CROSSREFS
|
Cf. A067026, A067027, A139439, A139440, A139441, A139442, A139443, A139444, A139445, A139446, A139447, A139448, A139449, A139450, A139451, A139452, A139453, A139454, A139455, A139456, A139457, A103514.
Adjacent sequences: A139454 A139455 A139456 this_sequence A139458 A139459 A139460
Sequence in context: A004608 A117905 A133445 this_sequence A049992 A074585 A108038
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Artur Jasinski (grafix(AT)csl.pl), Apr 21 2008
|
|
|
Search completed in 0.002 seconds
|
