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.

A231406 Table read by rows, with n-th row the smallest non-constant p-term arithmetic progression of primes beginning with p = prime(n).

Original entry on oeis.org

2, 3, 3, 5, 7, 5, 11, 17, 23, 29, 7, 157, 307, 457, 607, 757, 907, 11, 1536160091, 3072320171, 4608480251, 6144640331, 7680800411, 9216960491, 10753120571, 12289280651, 13825440731, 15361600811, 13, 9918821194603, 19837642389193, 29756463583783, 39675284778373, 49594105972963, 59512927167553, 69431748362143, 79350569556733, 89269390751323, 99188211945913, 109107033140503, 119025854335093, 17, 341976204789992332577
Offset: 1

Views

Author

Jonathan Sondow, Nov 08 2013

Keywords

Comments

For comments, references, and links, see the crossrefs.

Examples

			Triangle begins:
2 3
3 5 7
5 11 17 23 29
7 157 307 457 607 757 907
11 1536160091 3072320171 4608480251 6144640331 7680800411 9216960491 10753120571 12289280651 13825440731 15361600811
		

Crossrefs

For common differences see A088430, for initial terms see A000040, for 2nd terms see A231017, for last terms see A113834.

Formula

T(n,k) = prime(n) + k*A088430(n), 0 <= k < prime(n), n > 0.