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.

A244453 Prime factors of 2^A054723(n)-1, ordered by increasing n, then by increasing size of the factors.

Original entry on oeis.org

23, 89, 47, 178481, 233, 1103, 2089, 223, 616318177, 13367, 164511353, 431, 9719, 2099863, 2351, 4513, 13264529, 6361, 69431, 20394401, 179951, 3203431780337, 193707721, 761838257287, 228479, 48544121, 212885833
Offset: 1

Views

Author

Felix Fröhlich, Jun 28 2014

Keywords

Comments

Subsequence of A060443.
Prime factors of composite Mersenne numbers; A089162 with the Mersenne primes A000668 removed. - Jens Kruse Andersen, Jul 11 2014

Examples

			A054723(1) = 11. 2^11-1 = 2047 = 23*89. - _Jens Kruse Andersen_, Jul 11 2014
Triangle begins:
23, 89;
47, 178481;
233, 1103, 2089;
223, 616318177;
13367, 164511353;
431, 9719, 2099863;
2351, 4513, 13264529;
6361, 69431, 20394401;
		

Crossrefs

Programs

  • Mathematica
    Map[FactorInteger, Select[2^Prime@Range@20 - 1, CompositeQ]][[All, All, 1]] // Flatten (* Michael De Vlieger, Nov 20 2018 *)
  • PARI
    forprime(n=1, 100, m=2^n-1; if(!isprime(m), f=factor(m); for(i=1, #f~, print1(f[i,1]", ")))) \\ Jens Kruse Andersen, Jul 11 2014