|
|
A226368
|
|
Numbers k such that Omega(k) = Omega(2^k + 1), where Omega = A001222 is the number of prime factors counted with multiplicity.
|
|
0
|
|
|
2, 6, 36, 44, 52, 60, 72, 88, 112, 116, 136, 140, 152, 184, 288, 292, 320, 352, 388, 400, 404, 536, 544, 584, 632, 796, 844, 928, 1072, 1136
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
At the moment, the least candidate for a(31) is 1168 = 2^4 * 73; the entry for 2^1168 + 1 on factordb.com has 3 prime factors and 1 composite cofactor with 326 decimal digits. - Lucas A. Brown, Mar 19 2024
|
|
LINKS
|
|
|
FORMULA
|
|
|
PROG
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,more,hard
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|