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.

A176096 Smallest prime p = p(n) containing exactly n strings "13" (n = 1, 2, ...).

Table of values

n a(n)
1 13
2 13313
3 1313813
4 131313113
5 13131313133
6 1131313131313
7 131313131313139
8 13131313131313913
9 1313131311313131313
10 113131313131313131313
11 13131313131313133131313
12 1313131131313131313131313

List of values

[13, 13313, 1313813, 131313113, 13131313133, 1131313131313, 131313131313139, 13131313131313913, 1313131311313131313, 113131313131313131313, 13131313131313133131313, 1313131131313131313131313]

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

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