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.

A268706 Largest n-digit prime having at least n-1 digits equal to 7.

Original entry on oeis.org

7, 97, 977, 7877, 97777, 787777, 7877777, 77777747, 787777777, 8777777777, 79777777777, 777777779777, 7877777777777, 77777779777777, 778777777777777, 8777777777777777, 77797777777777777, 797777777777777777, 7777877777777777777, 97777777777777777777
Offset: 1

Views

Author

Keywords

Crossrefs

Programs

  • Maple
    f:= proc(n)
      local r,i,j,p;
      r:= 7*(10^n-1)/9;
      for p in sort([r, seq(seq(r + i*10^j, i=[$(-7)..(-1),1,2]),j=0..n-1)],`>`) do
        if isprime(p) then return p fi
      od;
      error("no prime found")
    end proc:
    map(f, [$1..100]); # Robert Israel, Feb 24 2016
  • Mathematica
    f[n_] := Block[{k = 0, p = {}, r = 7 (10^n - 1)/9, s = Range@ 10 - 8}, While[k < n, AppendTo[p, Select[r + 10^k*s, PrimeQ]]; k++]; p = Max@ Flatten@ p]; Array[f, 20]
Showing 1-1 of 1 results.