login

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

A242865
Numbers n such that 3^(n - 3) is congruent to 1 modulo n.
4
3, 9299, 31903, 50963, 87043, 115918, 116891, 219827, 241043, 394243, 550243, 617503, 760243, 806623, 1029253, 1050787, 1458083, 1642798, 1899458, 2864755, 3205387, 3588115, 3839363, 4164578, 5041223, 5610583, 5834755, 5977555, 7837903, 8005558, 8067433, 8128823, 9007603, 9298903, 9449113, 9617443, 9835843
OFFSET
1,1
LINKS
Daniel Starodubtsev, Table of n, a(n) for n = 1..372 (terms 1..163 from Felix Fröhlich)
MATHEMATICA
Select[Range[10^4], Mod[3^(# - 3), #] == 1 &] (* Alonso del Arte, May 27 2014 *)
PROG
(PARI) for(n=3, 10^6, if(Mod(3, n)^(n-3)==1, print1(n, ", ")))
CROSSREFS
Intersection with A033553 gives A277344.
Sequence in context: A356645 A362124 A158036 * A280300 A375690 A171363
KEYWORD
nonn
AUTHOR
Felix Fröhlich, May 24 2014
STATUS
approved