Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #40 Mar 22 2022 18:45:10
%S 0,0,0,0,1,0,1,1,0,1,2,0,1,1,1,1,2,0,1,1,1,2,3,1,2,2,0,1,2,1,2,1,2,2,
%T 2,0,1,1,1,1,2,1,2,2,1,2,3,1,2,2,2,2,3,0,1,1,1,2,3,1,2,2,1,1,2,2,3,2,
%U 3,2,3,1
%N Integer defect of n: a(n) = A005245(n) - A349983(n).
%D Harry Altman, Integer Complexity: The Integer Defect, Moscow Journal of Combinatorics and Number Theory 8-3 (2019), 193-217.
%H Harry Altman, <a href="https://arxiv.org/abs/1804.07446">Integer Complexity: The Integer Defect</a>, arXiv:1804.07446 [math.NT], 2018.
%Y Difference between A005245 and A349983 (the latter being almost the same as A007600).
%K nonn
%O 1,11
%A _Harry Altman_, Feb 06 2022