login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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
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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 4 15:02 EDT 2024. Contains 374923 sequences. (Running on oeis4.)