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

A351467
Numbers with integer defect at most 1; m such that A350723(m) <= 1.
3
1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 13, 14, 15, 16, 18, 19, 20, 21, 24, 27, 28, 30, 32, 36, 37, 38, 39, 40, 42, 45, 48, 54, 55, 56, 57, 60, 63, 64, 72, 81, 82, 84, 90, 96, 108, 109, 110, 111, 112, 114, 117, 120, 126, 128, 135, 144, 162, 163, 164, 165, 168, 171
OFFSET
1,2
COMMENTS
m appears in this list if and only if it can be written as 2^p*3^r for p <= 10 or as 2^p*(2^q*3^r+1)*3^s for p+q <= 2.
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
Cf. A350723, A005245, A349983. Contains A000792 as a subset.
Sequence in context: A247809 A247802 A245028 * A074402 A233264 A198343
KEYWORD
easy,nonn
AUTHOR
Harry Altman, Feb 12 2022
STATUS
approved