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.

A334885 Let q = p | p' be the digit concatenation of a prime p with its prime successor. If the result is a prime repeat the construction setting p = q. a(n) is the smallest prime for which this can be repeated exactly n times.

Table of values

n a(n)
0 3
1 2
2 13681
3 467
4 127787377
5 200603842261

List of values

[3, 2, 13681, 467, 127787377, 200603842261]

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

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