Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #11 Mar 13 2014 19:26:13
%S 2,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,
%T 6,2,10,2,4,2,12,12,4,2,4,6,2,10,6,6,6,2,6,4,2,6,4,14,4,2,4,6,8,6,10,
%U 2,4,6,2,6,6,6,4,6,2,6,4,8,10,2,10,2,4
%N Differences between terms of compacting Eratosthenes sieve for prime(7) = 17.
%C 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 Christopher J. Hanson, <a href="/A236188/b236188.txt">Table of n, a(n) for n = 1..5759</a>
%Y Cf. A236175-A236180, A236185-A236190.
%K nonn
%O 1,1
%A _Christopher J. Hanson_, Jan 21 2014