The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A273471 Primes p such that at least one of 1093*p or 1093*p^2 is a Poulet number, i.e., a term of A001567. 1
 1093, 4733, 21841, 503413, 1948129, 112901153, 23140471537, 467811806281, 4093204977277417, 8861085190774909, 556338525912325157, 86977595801949844993, 275700717951546566946854497, 3194753987813988499397428643895659569 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS The prime factors of 2^1092-1 that are congruent to 1 modulo 364 (the multiplicative order of 2 modulo 1093). -  Max Alekseyev, Aug 30 2016 LINKS G. P. Michon, Wieferich primes and some of their Poulet multiples Factordb, Factorization of 2^1092-1 PROG (PARI) forprime(p=1, , if(Mod(2, 1093*p)^(1093*p-1)==1 || Mod(2, 1093*p^2)^(1093*p^2-1)==1, print1(p, ", "))) CROSSREFS Cf. A001220, A001567, A273472. Sequence in context: A291194 A331021 A270833 * A266829 A203858 A115192 Adjacent sequences:  A273468 A273469 A273470 * A273472 A273473 A273474 KEYWORD nonn,fini,full AUTHOR Felix FrÃ¶hlich, May 23 2016 STATUS approved

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

Last modified July 24 16:24 EDT 2021. Contains 346273 sequences. (Running on oeis4.)