|
Search: id:A108098
|
|
|
| A108098 |
|
Numbers a(n) such that there is no k<=2a(n) with a(n)!+k!-1 prime. |
|
+0
1
|
|
| 48, 63, 68, 74, 111, 129, 135, 161, 168, 174, 197, 236, 240, 243, 273, 279, 282, 285, 309, 322, 335, 347, 360, 393, 407, 419, 431, 437, 439, 440, 455, 460, 461, 483, 491, 494, 497, 512, 517, 522, 526, 532, 544, 567, 591, 614, 625, 650, 662, 663, 681, 687
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
For numbers m <= 320 that are not in the sequence, there exists an integer k <= 2m such that m! + k! - 1 is a certified prime. For m > 320 the values of m! + k! - 1 are only probable primes. - Ryan Propper (rpropper(AT)stanford.edu), Sep 02 2005
|
|
MATHEMATICA
|
Do[l = Range[1, 2*n]; If[Length[Select[l, PrimeQ[n! + #! - 1]&]] == 0, Print[n]], {n, 1, 729}] (Propper)
|
|
CROSSREFS
|
Cf. A075758.
Adjacent sequences: A108095 A108096 A108097 this_sequence A108099 A108100 A108101
Sequence in context: A067191 A080854 A114821 this_sequence A114505 A045072 A100409
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Ralf Stephan, Jun 01 2005
|
|
EXTENSIONS
|
More terms from Ryan Propper (rpropper(AT)stanford.edu), Sep 02 2005
|
|
|
Search completed in 0.002 seconds
|
