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.

A060444 Table T(n,k) in which n-th row lists prime factors of 2^n + 1 (n >= 0), without repetition.

Original entry on oeis.org

2, 3, 5, 3, 17, 3, 11, 5, 13, 3, 43, 257, 3, 19, 5, 41, 3, 683, 17, 241, 3, 2731, 5, 29, 113, 3, 11, 331, 65537, 3, 43691, 5, 13, 37, 109, 3, 174763, 17, 61681, 3, 43, 5419, 5, 397, 2113, 3, 2796203, 97, 257, 673, 3, 11, 251, 4051
Offset: 0

Views

Author

Keywords

Comments

Rows have irregular lengths.
The length of row n is A046799(n).

Examples

			Triangle begins:
  2;
  3;
  5;
  3,17;
  3,11;
  5,13;
  3,43;
  257;
  ...
		

References

  • J. Brillhart et al., Factorizations of b^n +- 1. Contemporary Mathematics, Vol. 22, Amer. Math. Soc., Providence, RI, 2nd edition, 1985; and later supplements.

Crossrefs

Cf. A001269 (factors with repetition), A046799 (number of prime divisors).

Programs

  • Mathematica
    Flatten[Table[Transpose[FactorInteger[2^n+1]][[1]],{n,0,25}]] (* Harvey P. Dale, Aug 10 2011 *)
  • PARI
    apply( A060444_row(n)=factor(2^n+1)[,1]~, [0..10]) \\ M. F. Hasler, Nov 19 2018