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!)
A124924 Primes p such that p^2 divides A124923((3p-1)/2) = ((3p-1)/2)^(3(p-1)/2) + 1. 2
5, 13, 173, 5501 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
p divides A124923((3p-1)/2) for primes p in A003628. Hence this sequence is a subsequence of A003628.
Also, primes p such that (-2)^((p-1)/2) == -1-3p/2 (mod p^2).
No other terms below 10^11.
LINKS
EXAMPLE
5 is in this sequence because A124923((3*5-1)/2) = A124923(7) = 7^8 + 1 = 117650 is divisible by 5^2 = 25.
MATHEMATICA
Do[ p = Prime[n]; m = (3p-1)/2; f = PowerMod[ m, m-1, p^2 ] + 1; If[ IntegerQ[ f/p^2 ], Print[p] ], {n, 2, 10000} ]
CROSSREFS
Sequence in context: A214591 A159261 A117077 * A209271 A352083 A355763
KEYWORD
hard,more,nonn
AUTHOR
Alexander Adamchuk, Nov 12 2006
EXTENSIONS
Edited by Max Alekseyev, Jan 28 2012
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 19:52 EDT 2024. Contains 371963 sequences. (Running on oeis4.)