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!)
A273772 Least k > 1 such that n*(k*n-1) - 1 divides n^(k*n-1) - 1, or 0 if no such k exists. 0
381713, 58651, 12301, 2861, 1656278791, 547, 5179643, 214, 2719331, 26627, 73651287679, 90205, 5069, 5533707, 13117, 58385, 791716066017, 5589, 21214381292, 3802401, 509437122973, 167, 1261552, 6001, 1144853, 3111, 6952504, 143573 (list; graph; refs; listen; history; text; internal format)
OFFSET
2,1
COMMENTS
Is gcd(n, a(n)) = 1? - David A. Corneth, Jun 02 2016
No: gcd(15, a(15)) = 3. - Charles R Greathouse IV, Jun 04 2016
If a(30) is not 0, then it exceeds 5 * 10^12. Terms a(31) through a(34) are 4219, 124522631, 305201, and 6475739899. - Lucas A. Brown, Feb 28 2024
LINKS
PROG
(PARI) a(n)=my(k=2, n2=n^2); while(Mod(n, k*n2-n-1)^(k*n-1)!=1, k++); k \\ Charles R Greathouse IV, Jun 02 2016
CROSSREFS
Sequence in context: A133976 A286009 A295454 * A206365 A271323 A205759
KEYWORD
nonn,more
AUTHOR
EXTENSIONS
a(3) corrected by Charles R Greathouse IV, Jun 02 2016
a(6)-a(17) from Charles R Greathouse IV, Jun 04 2016
a(18)-a(29) from Lucas A. Brown, Feb 28 2024
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 March 29 09:59 EDT 2024. Contains 371268 sequences. (Running on oeis4.)