|
|
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
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
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
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|