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.
%I A162154 #10 Feb 21 2020 12:30:18
%S A162154 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,
%T A162154 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,
%U A162154 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
%N 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.
%H A162154 Harvey P. Dale, <a href="/A162154/b162154.txt">Table of n, a(n) for n = 1..1000</a>
%F A162154 a(2n) = A046933(n+1). - _R. J. Mathar_, Jun 27 2009
%F A162154 a(2n+1) = 1, for n>=1. - _Michel Marcus_, Feb 21 2020
%e A162154 a(1)=2 because there are two consecutive primes (2 and 3), a(2)=1 (4);
%e A162154 a(5)=1 (7), a(6)=3 because there are three consecutive composite (8,9,10).
%t A162154 Join[{2},Riffle[Last[#]-First[#]-1&/@Partition[Prime[Range[2,60]],2,1],1]] (* _Harvey P. Dale_, Jun 04 2012 *)
%Y A162154 Cf. A046933.
%K A162154 nonn
%O A162154 1,1
%A A162154 _Claudio Meller_, Jun 26 2009
%E A162154 Name edited by _Michel Marcus_, Feb 21 2020