login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A124045 Numbers n such that n^2 divide A123269(n) = Sum[ i^j^k, {i,1,n}, {j,1,n}, {k,1,n} ]. 0
1, 2, 3, 6, 42 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

COMMENTS

A123269(n) = Sum[ i^j^k, {i,1,n}, {j,1,n}, {k,1,n} ] = {1, 28, 7625731729896, ...}. Numbers n that divide A123269(n) are listed in A124391(n) = {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, ...}.

MATHEMATICA

Do[f=Sum[Mod[Sum[Mod[Sum[PowerMod[i, j^k, n^2], {i, 1, n}], n^2], {j, 1, n}], n^2], {k, 1, n}]; If[IntegerQ[f/n^2], Print[n]], {n, 1, 103}]

CROSSREFS

Cf. A123269, A124391, A039787, A086787.

Sequence in context: A018340 A184716 A018354 * A127315 A018359 A049383

Adjacent sequences:  A124042 A124043 A124044 * A124046 A124047 A124048

KEYWORD

hard,more,nonn

AUTHOR

Alexander Adamchuk (alex(AT)kolmogorov.com), Nov 02 2006

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 02:30 EST 2012. Contains 205978 sequences.