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.

A093871 a(n) is the n-th prime = -1 (mod n).

Original entry on oeis.org

2, 5, 11, 19, 89, 41, 181, 127, 251, 199, 571, 227, 1013, 433, 599, 751, 2039, 593, 2089, 859, 1637, 1429, 4001, 1103, 4049, 2053, 3779, 2267, 6263, 1499, 6571, 3583, 5279, 3943, 6089, 2879, 11321, 4597, 7331, 4919, 15497, 3779, 15307, 6599, 8009, 7681
Offset: 1

Views

Author

Amarnath Murthy, Apr 20 2004

Keywords

Comments

Main diagonal of A093870.

Crossrefs

Programs

  • Maple
    f:= proc(n) local p,count;
      count:= 0;
      for p from n-1 by n do
        if isprime(p) then
           count:= count+1;
           if count = n then return p fi
        fi
      od;
    end proc:
    map(f, [$1..100]); # Robert Israel, Nov 08 2019

Extensions

Edited and extended by Franklin T. Adams-Watters, Aug 29 2006