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!)
A333502 a(n) is the n-th number m such that m^2 divides n^m - 1 (or 0 if m does not exist). 1
1, 0, 4, 903, 12, 776119592182705, 12, 42931441, 136, 27486820443, 60, 107342336783, 84 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
LINKS
FORMULA
a(n) = A333500(n,n).
PROG
(PARI) {a(n) = if(n==2, 0, my(cnt=0, k=0); while(cnt<n, k++; if(Mod(n, k^2)^k==1, cnt++)); k)}
CROSSREFS
Main diagonal of A333500.
Sequence in context: A159706 A349077 A188978 * A202684 A332194 A364276
KEYWORD
nonn,more
AUTHOR
Seiichi Manyama, Mar 24 2020
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 April 24 14:54 EDT 2024. Contains 371960 sequences. (Running on oeis4.)