cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-2 of 2 results.

A303448 Numbers m such that both m and (m-1)/2 are Fermat pseudoprimes base 2 (A001567).

Original entry on oeis.org

19781763, 46912496118443, 192153584101141163
Offset: 1

Views

Author

Max Alekseyev, Apr 24 2018

Keywords

Comments

No other terms below 2^65.
Terms a(2) and a(3) are of the form (2^(2k+1)+1)/3 = A007583(k).
Terms A007583(k) belong to this sequence for k in A303009. Correspondingly, a(4) <= A007583(A303009(3)) = (2^83+1)/3 = 3223802185639011132549803.
If a(n) is not divisible by 3, then it also belongs to A175625.

Crossrefs

Numbers (a(n)-1)/2 are listed in A303447.
Subsequence of A006970 and A300193.

Formula

a(n) = 2*A303447(n) + 1.

Extensions

a(1) from Amiram Eldar, Jan 26 2018

A303009 Numbers n such that both A002450(n)=(2^(2n)-1)/3 and A007583(n)=2*A002450(n)+1 are Fermat pseudoprimes to base 2 (A001567).

Original entry on oeis.org

23, 29, 41, 53, 89, 113, 131, 179, 191, 233, 239, 251, 281, 293, 341, 359, 419, 431, 443, 491, 509, 593, 641, 653, 659, 683, 719, 743, 761, 809, 911, 953, 1013, 1019, 1031, 1049, 1103, 1223, 1229, 1271, 1289, 1409, 1439, 1451, 1481, 1499, 1511, 1559, 1583, 1601, 1733, 1811, 1889, 1901, 1931, 1973, 2003
Offset: 1

Views

Author

Max Alekseyev, Apr 23 2018

Keywords

Comments

It can be shown that if n is odd, it is a prime or a Fermat 4-pseudoprime (A020136) not divisible by 3. Similarly, 2n+1 is a prime or a Fermat 2-pseudoprime (A001567) not divisible by 3. In fact, the sequence is the union of the following six:
(i) primes n such that 2n+1 is prime (cf. A005384) and A007583(n) is composite, with smallest such term n=a(1)=23;
(ii) primes n==2 (mod 3) such that 2n+1 is a 2-psp (no such terms are known);
(iii) 4-pseudoprimes n==5 (mod 6) such that 2n+1 is prime and A007583(n) is composite, with smallest such term n=a(15)=341;
(iv) 4-pseudoprimes n==5 (mod 6) such that 2n+1 is 2-pseudoprime, with smallest such term n=268435455;
(v) n=2k, where 4k is in A015921 and k==1 (mod 3), such that 2n+1 is prime and A007583(n) is composite, with the smallest such term n=67166;
(vi) n=2k, where 4k is in A015921 and k==1 (mod 3), such that 2n+1 is a 2-psp, with the smallest such term n=9042986.

Crossrefs

Extensions

Edited by Max Alekseyev, Aug 08 2019
Showing 1-2 of 2 results.