This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A236187 Differences between terms of compacting Eratosthenes sieve for prime(6) = 13. 1
 4, 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, 2, 4, 6, 2, 10, 2, 4, 2, 12, 10, 2, 4, 2, 4, 6, 2, 6, 4, 6, 6, 6, 2, 6, 4, 2, 6, 4, 6, 8, 4, 2, 4, 6, 8, 6, 10, 2, 4, 6, 2, 6, 6, 4, 2, 4, 6, 2, 6, 4, 2, 6 (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..479 CROSSREFS Cf. A236175-A236180, A236185-A236190. Sequence in context: A007005 A237869 A066978 * A114566 A013679 A096428 Adjacent sequences:  A236184 A236185 A236186 * A236188 A236189 A236190 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 January 23 02:57 EST 2019. Contains 319368 sequences. (Running on oeis4.)