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

A093441 Lexicographically earliest sequence of primes such that a(n) - 1 == 0 (mod a(n - 1) - 1) where a(n) - 1 is a squarefree number; a(1) = 3.

Original entry on oeis.org

3, 7, 31, 211, 2311, 43891, 1272811, 16546531, 976245271, 36121074991, 1119753324691, 52628406260431, 3526103219448811, 186883470630786931, 7662222295862264131, 743235562698639620611, 54256196077000692304531, 6130950156701078230411891, 631487866140211057732424671
Offset: 1

Views

Author

Amarnath Murthy, Apr 01 2004

Keywords

Crossrefs

Distinct from A073918.
Cf. A083772. - R. J. Mathar, Sep 05 2008

Programs

  • Mathematica
    a[1] = 3; a[n_] := a[n] = Block[{k = m = a[n - 1] - 1}, k *= 2; While[ !PrimeQ[k + 1] || !SquareFreeQ[k], k += m]; k + 1]; Table[ a[n], {n, 17}] (* Robert G. Wilson v, Apr 30 2004 *)

Extensions

a(7)-a(17) from Robert G. Wilson v, Apr 30 2004
a(18)-a(19) from Amiram Eldar, Jan 19 2023
Showing 1-1 of 1 results.