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 A236190 #16 Mar 05 2017 13:24:24 %S A236190 6,2,6,4,2,4,6,6,2,6,4,2,6,4,6,8,4,2,4,2,4,14,4,6,2,10,2,6,6,4,6,6,2, %T A236190 10,2,4,2,12,12,4,2,4,6,2,10,6,6,6,2,6,4,2,10,14,4,2,4,14,6,10,2,4,6, %U A236190 8,6,6,4,6,8,4,8,10,2,10,2,6,4,6,8,4,2,4 %N A236190 Differences between terms of compacting Eratosthenes sieve for prime(9) = 23. %C A236190 P(x) is a function which represents a prime number at a particular ordinal x. This pattern, dp(x), describes the difference between consecutive prime numbers as described by p(x) (see A236175) and therefore the length of dp(x) is len(p(x)) - 1 and each value in dp(x) times P(x) is the difference between values determined not primed when running one pass of a reductive sieve, starting at P(x)^2. See A236185. %H A236190 Christopher J. Hanson, <a href="/A236190/b236190.txt">Table of n, a(n) for n = 1..10000</a> %Y A236190 Cf. A236175-A236180, A236185-A236190. %K A236190 nonn %O A236190 1,1 %A A236190 _Christopher J. Hanson_, Jan 21 2014