|
Search: id:A068488
|
|
|
| A068488 |
|
m for which p(m) is the least prime dividing #p(n) + 1, i.e. primorial n-th prime augmented by 1 (A005234). |
|
+0
2
|
|
| 2, 4, 11, 47, 344, 17, 8, 69, 66, 67, 8028643011, 42, 18, 39, 162, 21, 59, 48, 2311331257, 179, 369, 2477, 23289, 32, 172011, 75668, 342, 35, 28757, 356411, 243, 297, 152
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
Since #P34 +1 has two rather large factors, we need the number of primes less than or equal to 678279959005528882498681487.
|
|
LINKS
|
Hisanori Mishima, Factorization results #Pn (Primorial) + 1
|
|
FORMULA
|
PrimePi(A051342)
|
|
MATHEMATICA
|
Do[ Print[ PrimePi[ FactorInteger[ Product[ Prime[k], {k, 1, n}] + 1] [[1, 1]]]], {n, 1, 20} ]
|
|
CROSSREFS
|
Cf. A068489.
Sequence in context: A134019 A120259 A091240 this_sequence A096119 A117157 A057857
Adjacent sequences: A068485 A068486 A068487 this_sequence A068489 A068490 A068491
|
|
KEYWORD
|
hard,more,nonn
|
|
AUTHOR
|
Lekraj Beedassy (blekraj(AT)yahoo.com), Mar 11 2002
|
|
EXTENSIONS
|
Edited and extended by Robert G. Wilson v (rgwv(AT)rgwv.com), Mar 12 2002
|
|
|
Search completed in 0.002 seconds
|
