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.

A090870 a(n) is the smallest m such that d(m+k-1) = 2k for k = 1, ..., n where d(t)= prime(t+1) - prime(t) (differences of consecutive primes in arithmetic progression).

Table of values

n a(n)
1 2
2 3
3 7
4 69
5 1642
6 12073
7 12073
8 6496152
9 118033638
10 5575956036
11 165534366186
12 3265469041280
13 14779996741980
14 5701362336480884

List of values

[2, 3, 7, 69, 1642, 12073, 12073, 6496152, 118033638, 5575956036, 165534366186, 3265469041280, 14779996741980, 5701362336480884]

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

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