A306144 - OEIS

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

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A306144

Numbers k > 2 such that 3^(k-1) == 1 (mod k) and gcd(k, 2^(k-1)-1) = 1.

286, 16531, 24046, 49051, 72041, 182527, 192713, 232726, 258017, 327781, 442471, 443713, 453259, 574397, 625873, 652879, 655051, 668431, 705091, 903631, 1236031, 1241143, 1250833, 1287091, 1304446, 1309111, 1351601, 1414639, 1563151, 1817743, 1899451, 1908397

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

OFFSET

1,1

COMMENTS

The odd terms are "anti-Carmichael pseudoprimes (3,2)" defined as follows: numbers k > 1 such that 3^k == 3 (mod k) and gcd(k, 2^k-2) = 1. Cf. A300762 (2,3).

We impose k>2, since we want these to be pseudoprimes, thus composite numbers.

LINKS

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

MATHEMATICA

Select[Range[3, 2*10^6], PowerMod[3, #-1, #] == 1 && GCD[#, #-1 + PowerMod[2, #-1, #]] == 1 &] (* Giovanni Resta, Aug 18 2018 *)

PROG

(PARI) isok(k) = (k>2) && (Mod(3, k)^(k-1) == Mod(1, k)) && (gcd(k, 2^(k-1)-1) == 1); \\ Michel Marcus, Aug 18 2018

CROSSREFS

Subsequence of A005935.

Cf. A130433.

Sequence in context: A072817 A117994 A221431 * A130433 A140926 A295447

Adjacent sequences: A306141 A306142 A306143 * A306145 A306146 A306147