A236185 -id:A236185 - cp's OEIS frontend

A236186 Differences between terms of compacting Eratosthenes sieve for prime(5) = 11.

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, 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, 8, 4, 2, 4, 2, 4, 8, 6, 4, 6, 2, 4, 6, 2, 6, 6, 4, 2, 4

Offset: 1

Christopher J. Hanson, Jan 21 2014

nonn

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.

Cf. A236175-A236180, A236185-A236190.

Essentially the same as A049296.

{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 */

a(n + 48) = a(n). - Michael Somos, Mar 10 2014

Made sequence periodic. - Michael Somos, Mar 10 2014

cp's OEIS Frontend

A236186 Differences between terms of compacting Eratosthenes sieve for prime(5) = 11.

Views

Author

Keywords

Comments

Crossrefs

Programs

PARI

Formula

Extensions