The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A162154 Odd-indexed terms are the number of consecutive prime numbers until a composite, even-indexed terms are the number of consecutive composite numbers until a prime. 2
2, 1, 1, 1, 1, 3, 1, 1, 1, 3, 1, 1, 1, 3, 1, 5, 1, 1, 1, 5, 1, 3, 1, 1, 1, 3, 1, 5, 1, 5, 1, 1, 1, 5, 1, 3, 1, 1, 1, 5, 1, 3, 1, 5, 1, 7, 1, 3, 1, 1, 1, 3, 1, 1, 1, 3, 1, 13, 1, 3, 1, 5, 1, 1, 1, 9, 1, 1, 1, 5, 1, 5, 1, 3, 1, 5, 1, 5, 1, 1, 1, 9, 1, 1, 1, 3, 1, 1, 1, 11, 1, 11, 1, 3, 1, 1, 1, 3, 1, 5, 1, 1, 1, 9 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
FORMULA
a(2n) = A046933(n+1). - R. J. Mathar, Jun 27 2009
a(2n+1) = 1, for n>=1. - Michel Marcus, Feb 21 2020
EXAMPLE
a(1)=2 because there are two consecutive primes (2 and 3), a(2)=1 (4);
a(5)=1 (7), a(6)=3 because there are three consecutive composite (8,9,10).
MATHEMATICA
Join[{2}, Riffle[Last[#]-First[#]-1&/@Partition[Prime[Range[2, 60]], 2, 1], 1]] (* Harvey P. Dale, Jun 04 2012 *)
CROSSREFS
Cf. A046933.
Sequence in context: A306489 A319734 A211005 * A134505 A329376 A336643
KEYWORD
nonn
AUTHOR
Claudio Meller, Jun 26 2009
EXTENSIONS
Name edited by Michel Marcus, Feb 21 2020
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 3 03:48 EDT 2024. Contains 373054 sequences. (Running on oeis4.)