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.

A146941 Odd prime difference array. Let p(n) be the n-th odd prime; row n consists of all k such that p(k+1)-p(k)=2n.

Original entry on oeis.org

1, 2, 3, 4, 5, 8, 6, 7, 10, 23, 9, 11, 14, 71, 33, 12, 13, 15, 76, 41, 45, 16, 18, 17, 78, 52, 46, 29, 19, 21, 20, 86, 60, 90, 61, 281, 25, 24, 22, 91, 67, 96, 65, 294, 98, 27, 26, 31, 93, 79, 113, 136, 318, 179, 153, 32, 28, 35, 123, 81, 120, 145, 330, 204, 258, 188, 34
Offset: 1

Views

Author

Clark Kimberling, Nov 02 2008

Keywords

Comments

(Column 1) = A073051.

Examples

			Northwest corner:
1 2 4 6 9
3 5 7 11 13
8 10 14 15 17
23 71 76 78 86
Row 3: 6=p(9)-p(8)=p(11)-p(9)=p(15)-p(14)
That's 6=29-23=37-31=53-47.
		

Crossrefs

Programs

  • PARI
    lista_by_rows(nn) = {for (n=1, nn, nb = 0; k = 2; ok = 0; until(ok, if (prime(k+1) - prime(k) == 2*n, print1(k-1, ", "); nb++; if (nb == nn, ok = 1);); k++;); print(););} \\ Michel Marcus, Apr 21 2013