cp's OEIS Frontend

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.

Showing 1-1 of 1 results.

A182426 Lengths of runs of consecutive isolated primes beginning with A166251(n).

Original entry on oeis.org

2, 1, 1, 1, 3, 2, 1, 1, 2, 1, 1, 1, 3, 2, 1, 1, 3, 2, 1, 2, 1, 2, 1, 4, 3, 2, 1, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 1, 1, 2, 1, 1, 1, 1, 2, 1, 2, 1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 1, 4, 3, 2, 1, 1, 2, 1, 1, 1, 1, 2, 1, 2, 1, 2, 1, 1, 1, 1, 3, 2, 1, 2, 1, 1, 2, 1, 2, 1, 3, 2, 1
Offset: 1

Views

Author

Vladimir Shevelev, Apr 28 2012

Keywords

Comments

Theorem. If the sequence is unbounded, then there exist arbitrarily long sequences of consecutive primes p_k, p_(k+1),...,p_m such that every interval (p_i/2, p_(i+1)/2), i=k,k+1,...,m-1, contains a prime.

Crossrefs

Programs

  • Haskell
    import Data.List (group)
    a182426 n = a182426_list !! (n-1)
    a182426_list = concatMap f $ group $ zipWith (-) (tail ips) ips where
       f xs | head xs == 1 = reverse $ enumFromTo 2 $ length xs + 1
            | otherwise    = take (length xs) $ repeat 1
       ips = map a049084 a166251_list
    -- Reinhard Zumkeller, May 18 2012

Extensions

Data corrected: a(49)=2.
Showing 1-1 of 1 results.