|
| |
|
|
A038711
|
|
Smallest m such that A002110(n)+m is prime.
|
|
2
| |
|
|
1, 1, 1, 1, 1, 17, 19, 23, 37, 61, 1, 61, 71, 47, 107, 59, 61, 109, 89, 103, 79, 151, 197, 101, 103, 233, 223, 127, 223, 191, 163, 229, 643, 239, 157, 167, 439, 239, 199, 191, 199, 383, 233, 751, 313, 773, 607, 313, 383, 293, 443, 331, 283, 277, 271, 401, 307
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,6
|
|
|
COMMENTS
| Any composite a(n) would disprove Fortune's conjecture, see A005235. - Jeppe Stig Nielsen (mail(AT)jeppesn.dk), Oct 31 2003
|
|
|
FORMULA
| a(n)=Min[1, A005235(n)]; a(n)=1 for n=1, 2, 3, 4, 5, 11, 75, ...
a(n)=1 for n=1, 2, 3, 4, 5, 11, 75, ... (A014545); a(n)=A005235(n) otherwise - Jeppe Stig Nielsen (mail(AT)jeppesn.dk), Oct 31 2003
|
|
|
EXAMPLE
| For n=11, 1+A002110(11)=200560490131<200560490197=67+A002110(11) therefore a(11)=1 but A005235(11)=67.
|
|
|
MATHEMATICA
| nmax=2^16384; npd=1; n=1; npd=npd*Prime[n]; While[npd<nmax, tt=1; cp=npd+tt; While[ !(PrimeQ[cp]), tt=tt+2; cp=cp+2]; Print[tt]; n=n+1; npd=npd*Prime[n]] (Lei Zhou (lzhou5(AT)emory.edu), Feb 15 2005)
|
|
|
CROSSREFS
| A002110, A005235, A035345, A018239.
Sequence in context: A144487 A108266 A102325 * A154881 A205646 A073247
Adjacent sequences: A038708 A038709 A038710 * A038712 A038713 A038714
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Labos E. (labos(AT)ana.sote.hu), May 02 2000
|
| |
|
|
