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.

A263429 Smallest prime p such that binomial(2*p-1, p-1) == 1 (mod p^n), or 0 if no such p exists.

Table of values

n	a(n)
1	2
2	3
3	5
4	16843

List of values

[2, 3, 5, 16843]

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

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