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.

Previous Showing 11-13 of 13 results.

A306452 Pseudoprimes to base 3 that are not squarefree, including the non-coprime pseudoprimes.

Original entry on oeis.org

121, 726, 3751, 4961, 7381, 11011, 29161, 32791, 142901, 228811, 239701, 341341, 551881, 566401, 595441, 671671, 784201, 856801, 1016521, 1053426, 1237951, 1335961, 1433971, 1804231, 1916761, 2000251, 2254351, 2446741, 2817001, 2983981, 3078361, 3307051, 3562361
Offset: 1

Views

Author

Jianing Song, Feb 17 2019

Keywords

Comments

Numbers k such that 3^k == 3 (mod k) and k is divisible by the square of a Mirimanoff prime (or base-3 Wieferich prime), A014127.
A non-coprime pseudoprime in base b is a number k such that b^k == b (mod k) and that gcd(b, k) > 1, and the non-coprime pseudoprime in base 3 (726, 1053426, 6498426, ...) that are not squarefree are listed in A306450 while the others terms in this sequence (121, 3751, 4961, ...) are listed in A244065. So this sequence is the union of A244065 and A306450.
Intersection of A122780 and A013929.

Examples

			121 is a term because 3^120 == (3^5)^24 == 1 (mod 121) and 121 = 11^2.
Although 3^725 = 243 rather than 1 mod 726, we see that nevertheless 3^726 = 3 mod 726, and since 726 = 2 * 3 * 11^2, 726 is in the sequence. - _Alonso del Arte_, Mar 16 2019
		

Crossrefs

Programs

  • Mathematica
    Select[Range[5000], PowerMod[3, #, #] == 3 && MoebiusMu[#] == 0 &] (* Alonso del Arte, Mar 16 2019 *)
  • PARI
    forcomposite(n=1, 10^7, if(Mod(3, n)^n==3 && !issquarefree(n), print1(n, ", ")))

A353221 Squarefree base-2 Fermat pseudoprimes divisible by a Wieferich prime.

Original entry on oeis.org

3581761, 5173169, 5968873, 23872213, 36974341, 53711113, 107023281, 427294141, 490950461, 526359289, 546649741, 550230409, 753532781, 803264281, 836683849, 1115578101, 1168492417, 1193557093, 1540454761, 1632785701, 2129304997, 2295209281, 2677147201
Offset: 1

Views

Author

Felix Fröhlich, May 01 2022

Keywords

Comments

Subsequence of A001567.
The least term that is divisible by both 1093 and 3511 is a(799) = 7015325908501 = 937 * 1093 * 1951 * 3511. - Amiram Eldar, May 05 2022

Examples

			3581761 = 29 * 113 * 1093, so it is a base-2 pseudoprime divisible by the Wieferich prime 1093 and is squarefree.
		

Crossrefs

Programs

  • PARI
    /* The following program is valid up to the current search bound for Wieferich primes, about 10^19 as of May 03 2022 (cf. PrimeGrid); the program may miss terms above that bound if there is another Wieferich prime */
    forcomposite(c=1, , if(Mod(2, c)^(c-1)==1, if(Mod(c, 1093)==0 || Mod(c, 3511)==0, if(issquarefree(c), print1(c, ", ")))))

A376304 Strong pseudoprimes to base 2 that are not squarefree.

Original entry on oeis.org

1194649, 12327121, 3914864773, 5654273717, 26092328809, 58706246509, 74795779241, 237865367741, 467032496113, 601401837037, 1101047056201, 1629827375177, 2327330361721, 3427506518801, 3950198906473, 6151420925105, 7816904988985, 16034307692677
Offset: 1

Views

Author

Shyam Sunder Gupta, Sep 20 2024

Keywords

Comments

The intersection of A013929 and A001262.
All members of this sequence are divisible by a square of a Wieferich prime.

Examples

			a(5) = 26092328809 = 21841 * 1093^2 is a strong pseudoprime that is not squarefree.
		

Crossrefs

Previous Showing 11-13 of 13 results.