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.

A316908 a(n) is the smallest k with n prime factors such that 2^(k-1) == 1 (mod k) and p-1 does not divide k-1 for every prime p dividing k.

Table of values

n a(n)
2 7957
3 617093
4 134564501
5 384266404601
6 8748670222601
7 6105991025919737
8 901196605940857381

List of values

[7957, 617093, 134564501, 384266404601, 8748670222601, 6105991025919737, 901196605940857381]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.