|
|
A139024
|
|
Number of distinct prime factors of n! + 2^n - 1.
|
|
7
|
|
|
1, 1, 1, 2, 1, 2, 1, 3, 2, 4, 1, 4, 4, 4, 4, 4, 2, 5, 2, 7, 3, 3, 3, 6, 3, 3, 5, 6, 5, 6, 3, 7, 5, 6, 3, 8, 5, 8, 4, 7, 7, 5, 9, 6, 5, 5, 4, 10, 5, 6, 3, 6, 4, 6, 6, 11, 5, 2, 4, 13, 2, 6, 4, 8, 5, 6, 4, 5, 7, 9, 2, 11, 7, 5, 8, 6, 4, 6, 3, 10, 5, 3, 3, 9, 6, 4
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,4
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
a(6) = 2 since n! + 2^n - 1 = 6! + 2^6 - 1 = 783 = 3^3 * 29 has 2 distinct prime factors.
|
|
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
PrimeNu @ Table[n! + 2^n - 1, {n, 1, 30}] (* Amiram Eldar, Feb 05 2020 *)
|
|
PROG
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
a(1) - a(40) verified and a(41)- a(75) added by Klaus Brockhaus, Nov 19 2009
|
|
STATUS
|
approved
|
|
|
|