A229306 - OEIS

A229306

Numbers n such that A031971(6*n) <> n (mod 6*n)

7, 10, 14, 20, 21, 26, 28, 30, 35, 40, 42, 49, 50, 52, 55, 56, 57, 60, 63, 70, 77, 78, 80, 84, 90, 91, 98, 100, 104, 105, 110, 112, 114, 119, 120, 126, 130, 133, 136, 140, 147, 150, 154, 155, 156, 160, 161, 165, 168, 170, 171, 175, 180, 182, 189, 190, 196

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

OFFSET

1,1

COMMENTS

Complement of A229302.

The asymptotic density is in [0.2927, 0.3014].

If n is in A then k*n is in A for all natural number k.

The numbers k = 1, 2, 6, 42, 1806, 47058, 2214502422, 8490421583559688410706771261086 = A230311 are the only values of k such that the set {n: A031971(k*n) == n (mod k*n)} is nonempty. Its smallest element is n = 1, 1, 1, 1, 1, 5, 5, 39607528021345872635 = A231409. [Comment corrected and expanded by Jonathan Sondow, Dec 10 2013]

LINKS

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

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, n}], n]; Select[Range[100], !g[6*#] == # &]

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)).