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.

Previous Showing 11-11 of 11 results.

A164326 a(n) is the smallest number m such that (2k-1)m - 1 is prime for all 0 < k < n+1.

Original entry on oeis.org

3, 4, 4, 6, 6, 2100, 2100, 105828450, 3533468190, 240544635660, 7392639784530, 1896344521244250, 5389539504929580, 68086992545221650
Offset: 1

Views

Author

Farideh Firoozbakht, Sep 16 2009

Keywords

Crossrefs

Programs

  • Mathematica
    a[n_] := Block[{k=1}, While[! AllTrue[k  Range[1, 2 n - 1, 2] - 1, PrimeQ], k++]; k]; Array[a, 7] (* Giovanni Resta, Apr 01 2017 *)

Extensions

a(10) from Zak Seidov, Sep 21 2009
a(11)-a(14) from Giovanni Resta, Mar 31 2017
Previous Showing 11-11 of 11 results.