cp's OEIS Frontend

A249049 a(0)=1; thereafter a(n) = number of integers 1 <= i < A247665(n) that are not yet terms of A247665.

%I A249049 #10 May 08 2021 23:03:28
%S A249049 1,1,1,1,1,2,3,2,3,4,7,8,11,10,15,14,15,20,23,24,27,32,37,38,43,46,47,
%T A249049 46,45,50,53,52,51,56,63,66,67,70,71,74,81,86,89,94,95,104,105,110,
%U A249049 115,118,119,122,127,128,137,136,137,136,139,140,151,162,165,164,165
%N A249049 a(0)=1; thereafter a(n) = number of integers 1 <= i < A247665(n) that are not yet terms of A247665.
%C A249049 In short, the running count of missing terms in A247665.
%H A249049 N. J. A. Sloane, <a href="/A249049/b249049.txt">Table of n, a(n) for n = 0..10000</a>
%p A249049 # computes first M terms, assumes b1 is list of first M terms of A247665
%p A249049 M:=100; A:=[]; miss:=[1]; ctmiss:=[1]; last:=1; nom:=1;
%p A249049 for n from 1 to M do
%p A249049 t1:=b1[n]; A:=[op(A),t1];
%p A249049 if member(t1,miss) then nom:=nom-1; ctmiss:=[op(ctmiss),nom];
%p A249049    miss:=remove('x->x=t1',miss);
%p A249049 else
%p A249049    for i from last+1 to t1-1 do
%p A249049    if not member(i,A) and not member(i,miss) then miss:=[op(miss),i]; nom:=nom+1; fi;
%p A249049                              od:
%p A249049    ctmiss:=[op(ctmiss),nom];
%p A249049 fi;
%p A249049 last:=t1;
%p A249049 od:
%p A249049 ctmiss;
%Y A249049 Cf. A247665, A249050.
%K A249049 nonn
%O A249049 0,6
%A A249049 _N. J. A. Sloane_, Oct 30 2014