|
|
A051423
|
|
Numbers k such that the sum of prime divisors of k is congruent to 2^k (mod k).
|
|
1
|
|
|
15, 77, 99, 240, 354, 18870, 284481, 302174, 433197, 440973, 453086, 2446619, 5776855, 9961111, 17986255, 19091527, 28997648, 37443680, 40074848, 47602448, 67166528, 129389763, 141963648, 146259296, 152062688, 202038871, 203444576
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
Prime factors counted with multiplicity. - Harvey P. Dale, Jul 25 2013
|
|
LINKS
|
|
|
EXAMPLE
|
15 = 3*5 and 2^15 = 3+5 (mod 15).
|
|
MATHEMATICA
|
Select[Range[2500000], Total[Flatten[Table[#[[1]], {#[[2]]}]&/@ FactorInteger [#]]] ==PowerMod[2, #, #]&] (* Harvey P. Dale, Jul 25 2013 *)
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy,nice
|
|
AUTHOR
|
Joe K. Crump (joecr(AT)carolina.rr.com)
|
|
STATUS
|
approved
|
|
|
|