The OEIS is supported by the many generous donors to the OEIS Foundation.

 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; text; 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, ...}. LINKS 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: A299121 A184716 A018354 * A127315 A018359 A274805 Adjacent sequences:  A124042 A124043 A124044 * A124046 A124047 A124048 KEYWORD hard,more,nonn AUTHOR Alexander Adamchuk, Nov 02 2006 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified May 22 09:50 EDT 2022. Contains 353949 sequences. (Running on oeis4.)