A123269 -id:A123269 - cp's OEIS frontend

A124391 Numbers m that divide A123269(m) = Sum_{i=1..m, j=1..m, k=1..m} i^j^k.

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

Offset: 1

Alexander Adamchuk, Oct 30 2006

A123269(m) = Sum_{i=1..m, j=1..m, k=1..m} i^j^k = {1, 28, 7625731729896, ...}.

Primes terms are listed in A039787.

Cf. A123269, A039787, A086787.

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}]

A124045 Numbers n such that n^2 divide A123269(n) = Sum[ i^j^k, {i,1,n}, {j,1,n}, {k,1,n} ].

Original entry on oeis.org

1, 2, 3, 6, 42

Offset: 1

Alexander Adamchuk, Nov 02 2006

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, ...}.

Cf. A123269, A124391, A039787, A086787.

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}]

cp's OEIS Frontend

A124391 Numbers m that divide A123269(m) = Sum_{i=1..m, j=1..m, k=1..m} i^j^k.

Views

Author

Keywords

Comments

Crossrefs

Programs

Mathematica