|
Search: id:A139465
|
|
|
| A139465 |
|
Number of distinct prime factors of n! + 2n - 1. |
|
+0
4
|
|
| 1, 1, 1, 1, 2, 2, 2, 3, 1, 1, 5, 2, 3, 4, 2, 2, 3, 4, 3, 3, 3, 3, 4, 2, 5, 4, 2, 6, 6, 2, 4, 5, 5, 3, 3, 3, 2, 5, 5, 4
(list; graph; listen)
|
|
|
OFFSET
|
1,5
|
|
|
REFERENCES
|
F. Luca and I. E. Shparlinsky, 2005. On the largest prime factor of n! + 2n - 1. J. Th. des Nombres de Bordeaux Vol.17, Fasc. 3
|
|
MATHEMATICA
|
a = {}; Do[AppendTo[a, n! + 2 n - 1], {n, 1, 40}]; b = {}; Do[c = Length[FactorInteger[a[[n]]]]; AppendTo[b, c], {n, 1, Length[a]}]; b (*Artur Jasinski*)
|
|
CROSSREFS
|
Cf. A127986, A127987, A139023, A139024, A139464, A139466, A139467.
Adjacent sequences: A139462 A139463 A139464 this_sequence A139466 A139467 A139468
Sequence in context: A112599 A106795 A071455 this_sequence A010244 A141298 A103960
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Artur Jasinski (grafix(AT)csl.pl), Apr 22 2008
|
|
|
Search completed in 0.002 seconds
|
