|
|
A124391
|
|
Numbers m that divide A123269(m) = Sum_{i=1..m, j=1..m, k=1..m} i^j^k.
|
|
2
|
|
|
1, 2, 3, 4, 6, 7, 8, 9, 11, 12, 14, 16, 18, 20, 21, 22, 23, 24, 27, 28, 31, 32, 33, 36, 40, 42, 43, 44, 46, 47, 48, 49, 54, 56, 59, 60, 62, 63, 64, 66, 67, 69, 71, 72, 77, 79, 80, 81, 83, 84, 86, 88, 92, 93, 94, 96, 98, 99, 100, 103
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
A123269(m) = Sum_{i=1..m, j=1..m, k=1..m} i^j^k = {1, 28, 7625731729896, ...}.
Primes terms are listed in A039787.
|
|
LINKS
|
|
|
MATHEMATICA
|
Do[f=Sum[Mod[Sum[Mod[Sum[PowerMod[i, j^k, n], {i, 1, n}], n], {j, 1, n}], n], {k, 1, n}]; If[IntegerQ[f/n], Print[n]], {n, 1, 103}]
|
|
CROSSREFS
|
|
|
KEYWORD
|
hard,more,nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|