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.
%I A096450 #7 Apr 19 2016 01:07:34 %S A096450 7,29,37,61,89,101,107,113,131,151,181,239,251,271,397,421,443,463, %T A096450 479,491,503,557,569,577,601,743,757,787,857,863,881,887,1291,1511, %U A096450 1531,1549,1609,1657,1667,1693,1699,1861,1987,1997,2003,2017,2053,2377,2393 %N A096450 Primes p such that the number of primes q, 7 <= q < p, congruent to 1 or 2 mod 5, is equal to the number of such primes congruent to 3 or 4 mod 5. %C A096450 First term prime(4) = 7 is placed on 0th row. %C A096450 If prime(n-1) = 1 or 2 mod 5 is on k-th row then we put prime(n) on (k-1)-st row. %C A096450 If prime(n-1) = -1 or -2 mod 5 is on k-th row then we put prime(n) on (k+1)-st row. %C A096450 This process produces the following array of prime numbers: %C A096450 31, 97, ... row -1 %C A096450 7, 29, 37, 61, 89, 101, ... row 0 (this sequence) %C A096450 11, 17, 23, 41, 47, 59, 67, 83, ... row 1 (A096454) %C A096450 13, 19, 43, 53, 71, 79, ... row 2 (A096455) %C A096450 73, ... %Y A096450 Cf. A096448-A096455. %K A096450 nonn,easy %O A096450 1,1 %A A096450 _Yasutoshi Kohmoto_, Aug 12 2004 %E A096450 More terms and better definition from _Joshua Zucker_, May 21 2006