A229308 Primitive numbers in A229304.

10, 26, 55, 57, 58, 136, 155, 222, 253, 346, 355, 381, 737, 876, 904, 1027, 1055, 1081, 1552, 1711, 1751, 1962, 2155, 2696, 2758, 3197, 3403, 3411, 3775, 3916, 4063, 4132, 4401, 5093, 5671, 6176, 6455, 6567, 7111, 7226, 8251, 8515, 8702, 9294, 9316, 9465

Offset

1,1

Links

Table of n, a(n) for n=1..46.

Jose María Grau, A. M. Oller-Marcen, and J. Sondow, On the congruence 1^n + 2^n +... + n^n = d (mod n), where d divides n

Mathematica

g[n_] := Mod[Sum[PowerMod[i, n, n], {i, 1, n}], n]; tachar[lis_, num_] := Select[lis, ! IntegerQ[#1/num] &]; primi[{}] = {}; primi[lis_] := Join[{lis[[1]]}, primi[tachar[lis, lis[[1]]]]]; primi@Select[Range[70], ! g[1806*#] == # &]

Crossrefs

Cf. A014117 (numbers n such that A031971(n)==1 (mod n)).

Cf. A229300 (numbers n such that A031971(1806*n)== n (mod n*1806)).

Cf. A229301 (numbers n such that A031971(42*n) == n (mod 42*n)).

Cf. A229302 (numbers n such that A031971(6*n) == n (mod 6*n)).

Cf. A229303 (numbers n such that A031971(2*n) == n (mod 2*n)).

Cf. A229304 (numbers n such that A031971(1806*n) <> n (mod n*1806)).

Cf. A229305 (numbers n such that A031971(42*n) <> n (mod 42*n)).

Cf. A229306 (numbers n such that A031971(6*n) <> n (mod 6*n)).

Cf. A229307 (numbers n such that A031971(2*n) <> n (mod 2*n)).

Cf. A229308 (primitive numbers in A229304).

Cf. A229309 (primitive numbers in A229305).

Cf. A229310 (primitive numbers in A229306).

Cf. A229311 (primitive numbers in A229307).

Sequence in context: A242719 A242489 A074789 * A125075 A209983 A055710

Adjacent sequences: A229305 A229306 A229307 * A229309 A229310 A229311

Keyword

nonn

Author

José María Grau Ribas, Sep 20 2013

Status

approved