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

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, 46, 45, 50, 53, 52, 51, 56, 63, 66, 67, 70, 71, 74, 81, 86, 89, 94, 95, 104, 105, 110, 115, 118, 119, 122, 127, 128, 137, 136, 137, 136, 139, 140, 151, 162, 165, 164, 165

Offset

0,6

Comments

In short, the running count of missing terms in A247665.

Links

N. J. A. Sloane, Table of n, a(n) for n = 0..10000

Maple

# computes first M terms, assumes b1 is list of first M terms of A247665
M:=100; A:=[]; miss:=[1]; ctmiss:=[1]; last:=1; nom:=1;
for n from 1 to M do
t1:=b1[n]; A:=[op(A), t1];
if member(t1, miss) then nom:=nom-1; ctmiss:=[op(ctmiss), nom];
   miss:=remove('x->x=t1', miss);
else
   for i from last+1 to t1-1 do
   if not member(i, A) and not member(i, miss) then miss:=[op(miss), i]; nom:=nom+1; fi;
                             od:
   ctmiss:=[op(ctmiss), nom];
fi;
last:=t1;
od:
ctmiss;

Crossrefs

Cf. A247665, A249050.

Sequence in context: A342847 A345873 A114868 * A138239 A361330 A112484

Adjacent sequences: A249046 A249047 A249048 * A249050 A249051 A249052

Keyword

nonn

Author

N. J. A. Sloane, Oct 30 2014

Status

approved