The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Please make a donation to keep the OEIS running. We are now in our 56th year. In the past year we added 10000 new sequences and reached almost 9000 citations (which often say "discovered thanks to the OEIS"). Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A236189 Differences between terms of compacting Eratosthenes sieve for prime(8) = 19. 1
 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, 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, 6, 2, 6, 6, 6, 4, 6, 8, 4, 8, 10, 2, 10, 2, 4, 2, 4, 6, 8 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS 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. LINKS Christopher J. Hanson, Table of n, a(n) for n = 1..92159 CROSSREFS Cf. A236175-A236180, A236185-A236190. Sequence in context: A225092 A029677 A045867 * A114403 A137662 A336049 Adjacent sequences:  A236186 A236187 A236188 * A236190 A236191 A236192 KEYWORD nonn AUTHOR Christopher J. Hanson, Jan 21 2014 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 4 12:45 EST 2020. Contains 338923 sequences. (Running on oeis4.)