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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A321365 Positive integers n such that 13^n == 14 (mod n). 1
1, 5805311, 392908759, 399614833907, 2674764845549, 21997277871211, 67146783889057 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
No other terms below 10^15.
LINKS
PROG
(PARI) is(n) = Mod(13, n)^n==14; \\ Felix Fröhlich, Nov 08 2018
CROSSREFS
Solutions to 13^n == k (mod n): A001022 (k=0), A015963 (k=-1), A116621 (k=1), A116622 (k=2), A116629 (k=3), A116630 (k=4), A116611 (k=5), A116631 (k=6), A116632 (k=7), A295532 (k=8), A116636 (k=9), A116620(k=10), A116638 (k=11), A321364 (k=12), this sequence (k=14), A116639 (k=15).
Sequence in context: A235983 A203931 A309835 * A335255 A250503 A268333
KEYWORD
nonn,more
AUTHOR
Max Alekseyev, Nov 08 2018
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 14 06:54 EDT 2024. Contains 375920 sequences. (Running on oeis4.)