%I #13 Oct 11 2020 14:52:57

%S 0,3,6,5,4,3,2,1,0,7,8,7,6,5,8,7,6,5,4,3,2,1,0,-1,-2,-3,-4,-5,-6,-7,

%T -8,-9,-10,-11,0,-1,-2,-3,4,3,2,1,4,3,2,1,0,-1,-2,-3,-4,-5,-6,-7,-8,

%U -9,-10,-11,-12,-13,-14,-15,-16,-17,-18,-19,-14,-15,-16,-17,-6,-7,-8,-9,-4,-5,-6,-7,-2,-3,-4,-5,2,1,0

%N a(n) = A337645(n-1) - n.

%C Motivation: This is (smallest missing legal number in A336967) - n. For when we are trying to find A336957(n), the smallest legal possibility is A337645(n-1), which appears to grow like n.

%C However, the conclusion from looking at the graph of the present sequence is that A337645(n) ~ n*(1 - 1/50) or perhaps n*(1 - c/log n) would be a better approximation to A337645.

%H N. J. A. Sloane, <a href="/A338052/b338052.txt">Table of n, a(n) for n = 2..20001</a>

%K sign

%O 2,2

%A _Scott R. Shannon_ and _N. J. A. Sloane_, Oct 11 2020