The OEIS is supported by the many generous donors to the OEIS Foundation.
%I #24 Aug 01 2024 01:31:22
%S 4,3,3,2,1,3,1,2,3,2,1,2,1,3,1,2,3,1,2,2,1,2,1,1,2,3,3,2,1,1,1,1,1,2,
%T 2,1,3,1,1,1,3,1,2,1,2,2,1,2,1,3,1,1,1,3,3,1,1,1,1,2,1,1,1,1,2,3,2,1,
%U 3,1,1,1,2,1,2,1,2,1,3,1,2,3,1,1,1,2
%N Half of the gaps A067970 between odd nonprimes A014076.
%C a(n) < 4 for n > 1; a(A196276(a(n)) = 1; a(A196277(a(n)) > 1. [_Reinhard Zumkeller_, Sep 30 2011]
%C Lengths of runs of equal terms in A025549. That sequence begins with: 1,1,1,1,3,3,3,45,45,45,..., that is 4 ones, 3 threes, 3 forty-fives, ... - _Michel Marcus_, Dec 02 2014
%H Reinhard Zumkeller, <a href="/A196274/b196274.txt">Table of n, a(n) for n = 1..10000</a>
%F a(n) = (A014076(n+1)-A014076(n))/2 = A067970(n)/2.
%e The smallest odd numbers which are not prime are 1, 9, 15, 21, 25, 27,... (sequence A014076).
%e The gaps between these are: 8, 6, 6, 4, 2,... (sequence A067970), which are of course all even by construction, so it makes sense to divide all of them by 2, which yields this sequence: 4, 3, 3, 2, 1, ...
%t With[{nn=401},Differences[Complement[Range[1,nn,2],Prime[Range[ PrimePi[ nn]]]]]/2] (* _Harvey P. Dale_, May 06 2012 *)
%o (PARI) L=1;forstep(n=3,299,2,isprime(n)&next;print1((n-L)/2",");L=n)
%o (Python)
%o from sympy import primepi, isprime
%o def A196274(n):
%o if n == 1: return 4
%o m, k = n-1, primepi(n) + n - 1 + (n>>1)
%o while m != k:
%o m, k = k, primepi(k) + n - 1 + (k>>1)
%o for d in range(1,4):
%o if not isprime(m+(d<<1)):
%o return d # _Chai Wah Wu_, Jul 31 2024
%Y Cf. A142723 for the decimal value of the associated continued fraction.
%K nonn
%O 1,1
%A _M. F. Hasler_, Sep 30 2011
%E More terms from _Harvey P. Dale_, May 06 2012