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-5 of 5 results.

A242715 Prime divisors of 2^3510-1, listed with multiplicities.

Original entry on oeis.org

3, 3, 3, 3, 7, 11, 19, 31, 73, 79, 131, 151, 271, 331, 631, 811, 937, 1171, 2731, 3511, 3511, 6553, 8191, 10531, 15121, 23311, 65521, 86113, 87211, 107251, 121369, 262657, 348031, 409891, 446473, 1024921, 1969111, 4633201, 7623851, 18837001, 22366891, 29121769
Offset: 1

Views

Author

Felix Fröhlich, May 21 2014

Keywords

Crossrefs

The corresponding sequence for 1093 is A172290.
Cf. A001220.

Programs

  • PARI
    forprime(n=2, 1e6, m=n; while(Mod(2,m)^3510-1==0, print1(n, ", "); m=m*n))

Extensions

More terms from Amiram Eldar, Oct 07 2019

A177855 Divisors of 2^1092 - 1.

Original entry on oeis.org

1, 3, 5, 7, 9, 13, 15, 21, 29, 35, 39, 43, 45, 49, 53, 63, 65, 79, 87, 91, 105, 113, 117, 127, 129, 145, 147, 157, 159, 169, 195, 203, 215, 237, 245, 261, 265, 273, 301, 313, 315, 337, 339, 371, 377, 381, 387, 395, 435, 441, 455, 471, 477, 507, 547, 553, 559, 565
Offset: 1

Views

Author

Reinhard Zumkeller, May 14 2010

Keywords

Comments

The sequence is finite with A000005(2^1092-1) = 178120883699712 terms.

Crossrefs

Programs

A172291 Numbers greater than 1 whose square divide 2^1092-1.

Original entry on oeis.org

3, 7, 13, 1093
Offset: 1

Views

Author

Artur Jasinski, Jan 30 2010

Keywords

Comments

Up to now only two primes p such that p^2 divides 2^(p-1)-1 are known (these two are Wieferich primes, see A001220).

Examples

			From _Reinhard Zumkeller_, May 14 2010: (Start)
a(1)^2 = 9 = A177855(5);
a(2)^2 = 49 = A177855(14);
a(3)^2 = 169 = A177855(30);
a(4)^2 = 1194649 = A177855(1843). (End)
		

Crossrefs

Extensions

Keyword full added by Reinhard Zumkeller, May 14 2010

A273085 Prime divisors of 68^112 - 1, listed with multiplicities.

Original entry on oeis.org

3, 5, 5, 5, 23, 29, 37, 41, 67, 113, 113, 113, 197, 617, 881, 10193, 103867, 521497, 938071, 1106356357, 1546157677, 100343116693, 518914006417, 1145565031404704513, 135178919999357237393881, 620712448371732926474772025689944913040651041015217889164158638163856301549281
Offset: 1

Views

Author

Felix Fröhlich, May 14 2016

Keywords

Comments

(68^112-1)/113 is the only known Fermat quotient q_p(b) = (b^(p-1)-1)/p with 1 < b < p and q_p(b) divisible by p^2.

Examples

			68^112 == 1 (mod 113^3), but 68^112 =/= 1 (mod 113^4), so 113 appears three times in the sequence.
		

Crossrefs

Programs

  • PARI
    forprime(p=1, 68^112-1, my(k=1); while(Mod(68, p^k)^112==1, print1(p, ", "); k++))

A343763 Common prime factors of A007663(183)/1093 and A007663(490)/3511.

Original entry on oeis.org

3, 7, 79, 2731, 8191, 121369, 22366891
Offset: 1

Views

Author

Felix Fröhlich, Apr 28 2021

Keywords

Comments

The sequence is complete (cf. Michon).
Are these primes necessarily prime factors of A007663(i)/p when p = prime(i) is a Wieferich prime (A001220)?
Note the following curious observation: 3 * 7 * 79 * 2731 * 8191 * 121369 * 22366891 = 100743818301219097892181. That number is a repdigit in bases 4 and 64 and undulating in bases 2, 8, 128, 2048 and 8192. Compare that to observations from John Blythe Dobson (cf. Dobson).

Crossrefs

Programs

  • PARI
    fq(n) = (2^(n-1)-1)/n
    my(x=fq(1093)/1093, y=fq(3511)/3511); forprime(p=1, , if(Mod(x, p)==0 && Mod(y, p)==0, print1(p, ", ")))
Showing 1-5 of 5 results.