The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A188063 Numbers n with property that n==5 (mod 12) and 2^(m-1)=1 (mod m) where m=(2*n-1)*n. 0
17, 281, 677, 953, 2729, 4241, 4637, 18749, 55217, 112997, 115769, 148781, 151733, 326693, 623393, 637841, 744833, 907733, 1056833, 1444481, 1774937, 1831481, 1866737, 1939097, 2028197, 2564369, 2566601, 3146237, 4635317, 4777433, 5629157, 5960501, 6247601, 6837221, 7248737, 7278041, 7340537, 7442849, 7766237 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
All terms <= 10^9 are prime, are there any composite terms?
LINKS
MATHEMATICA
Select[Range[5, 777*10^4, 12], PowerMod[2, #(2#-1)-1, #(2#-1)]==1&] (* Harvey P. Dale, Sep 07 2021 *)
PROG
(PARI)
{ forstep (n=5, 10^9, 12,
m = (2*n-1)*n;
t = Mod(2, m)^(m-1);
if ( component(t, 2) == 1,
print1(n, ", "); /* print term */
/* if ( !isprime(n), print1(n, ", ") ); */ /* print only nonprime terms */
); ); } /* Joerg Arndt, Apr 01 2011 */
CROSSREFS
Sequence in context: A113076 A159503 A245940 * A012235 A196743 A196901
KEYWORD
nonn
AUTHOR
Alzhekeyev Ascar M, Mar 20 2011
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 June 2 13:10 EDT 2024. Contains 373040 sequences. (Running on oeis4.)