login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A276671 Positive integers n such that 3^n == 2 (mod n). 13
1, 2929, 9742277641, 23341869101 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

No other terms below 10^15. A larger term: 31744873758348589012852097851.

LINKS

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

MATHEMATICA

Join[{1}, Select[Range[10000], PowerMod[3, #, #] == 2 &]] (* Alonso del Arte, Oct 11 2016 *)

PROG

(PARI) isok(n) = Mod(3, n)^n == Mod(2, n); \\ Dmitry Ezhov, Sep 28 2016

CROSSREFS

Cf. A015973, A067945, A015949, A055686, A242865, A234535, A234536, A050259.

Sequence in context: A127490 A237079 A128149 * A251233 A251983 A251976

Adjacent sequences:  A276668 A276669 A276670 * A276672 A276673 A276674

KEYWORD

nonn,more,hard

AUTHOR

Max Alekseyev, Oct 05 2016

EXTENSIONS

Order of terms corrected by Felix Fröhlich, Oct 06 2016

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 13 15:18 EDT 2020. Contains 335688 sequences. (Running on oeis4.)