A229311 - OEIS

A229311

Primitive numbers in A229307.

3, 10, 55, 136, 253, 406, 1081, 1378, 1711, 2485, 3403, 3916, 5671, 6328, 8515, 9316, 11026, 13861, 14878, 15931, 18145, 19306, 25651, 27028, 28441, 31375, 32896, 34453, 36046, 42778, 48205, 50086, 60031, 62128, 64261, 73153, 75466, 87571, 92665, 97903

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,1

LINKS

Robert G. Wilson v, Table of n, a(n) for n = 1..67

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[500], !g[2*#] == # &]

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: A054422 A074503 A318188 * A208480 A342966 A359976

Adjacent sequences: A229308 A229309 A229310 * A229312 A229313 A229314

KEYWORD

nonn

AUTHOR

José María Grau Ribas, Sep 24 2013

STATUS

approved