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.

A347141 a(1) = 11; for n > 1, a(n) is the smallest prime factor of 2^a(n-1) - 1.

Original entry on oeis.org

11, 23, 47, 2351, 4703
Offset: 1

Views

Author

J. Lowell, Aug 19 2021

Keywords

Examples

			2^11 - 1 = 23*89, so the next term after 11 is 23.
		

Crossrefs

Cf. A049479.

Programs

  • Mathematica
    a[1] = 11; a[n_] := a[n] = Module[{p = 3}, While[PowerMod[2, a[n - 1], p] != 1, p = NextPrime[p]]; p]; Array[a, 5] (* Amiram Eldar, Aug 19 2021 *)