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 A236186 #15 Jun 30 2025 13:23:15
%S A236186 2,4,2,4,6,2,6,4,2,4,6,6,2,6,4,2,6,4,6,8,4,2,4,2,4,8,6,4,6,2,4,6,2,6,
%T A236186 6,4,2,4,6,2,6,4,2,4,2,10,2,10,2,4,2,4,6,2,6,4,2,4,6,6,2,6,4,2,6,4,6,
%U A236186 8,4,2,4,2,4,8,6,4,6,2,4,6,2,6,6,4,2,4
%N A236186 Differences between terms of compacting Eratosthenes sieve for prime(5) = 11.
%C A236186 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.
%F A236186 a(n + 48) = a(n). - _Michael Somos_, Mar 10 2014
%o A236186 (PARI) {a(n) = my(A); if( n<1, 0, A = vector( n*50 + 148, k, k+1); for( i = 1, 4, A = select( k -> k%prime(i), A) ); polcoeff( (1 - x) * Ser( select( k -> k>11 && (k%11) == 0, A) / 11), n))}; /* _Michael Somos_, Mar 10 2014 */
%Y A236186 Cf. A236175-A236180, A236185-A236190.
%Y A236186 Essentially the same as A049296.
%K A236186 nonn
%O A236186 1,1
%A A236186 _Christopher J. Hanson_, Jan 21 2014
%E A236186 Made sequence periodic. - _Michael Somos_, Mar 10 2014