login

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”).

A350723
Integer defect of n: a(n) = A005245(n) - A349983(n).
4
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, 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, 3, 2, 3, 1
OFFSET
1,11
REFERENCES
Harry Altman, Integer Complexity: The Integer Defect, Moscow Journal of Combinatorics and Number Theory 8-3 (2019), 193-217.
LINKS
Harry Altman, Integer Complexity: The Integer Defect, arXiv:1804.07446 [math.NT], 2018.
CROSSREFS
Difference between A005245 and A349983 (the latter being almost the same as A007600).
Sequence in context: A321764 A333809 A306440 * A025905 A115861 A282355
KEYWORD
nonn
AUTHOR
Harry Altman, Feb 06 2022
STATUS
approved