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!)
A354025 Terms m of A351467 such that A005245(m) == 2 (mod 3). 2
2, 5, 6, 13, 14, 15, 16, 18, 37, 38, 39, 40, 42, 45, 48, 54, 109, 110, 111, 112, 114, 117, 120, 126, 128, 135, 144, 162, 325, 326, 327, 328, 330, 333, 336, 342, 351, 360, 378, 384, 405, 432, 486, 973, 974, 975, 976, 978, 981, 984, 990, 999 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
m appears in this list if and only if it can be written as 2^p*3^r for p in {1,4,7,10} or as 4(3^r+1)3^s (r>0) or 2(2*3^r+1)3^s or (4*3^r+1)3^s.
LINKS
Harry Altman, Integer Complexity: The Integer Defect, Moscow Journal of Combinatorics and Number Theory 8-3 (2019), 193-217; arXiv:1804.07446 [math.NT], 2018.
CROSSREFS
Sequence in context: A277022 A232603 A069480 * A100613 A070911 A276082
KEYWORD
easy,nonn
AUTHOR
Harry Altman, May 14 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 March 29 04:59 EDT 2024. Contains 371264 sequences. (Running on oeis4.)