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 A236189 #11 Mar 13 2014 19:27:31 %S A236189 4,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, %T A236189 2,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, %U A236189 6,2,6,6,6,4,6,8,4,8,10,2,10,2,4,2,4,6,8 %N A236189 Differences between terms of compacting Eratosthenes sieve for prime(8) = 19. %C A236189 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 A236189 Christopher J. Hanson, <a href="/A236189/b236189.txt">Table of n, a(n) for n = 1..92159</a> %Y A236189 Cf. A236175-A236180, A236185-A236190. %K A236189 nonn %O A236189 1,1 %A A236189 _Christopher J. Hanson_, Jan 21 2014