This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A354023 #18 Aug 23 2023 12:19:06
%S A354023 3,7,8,9,19,20,21,24,27,55,56,57,60,63,64,72,81,163,164,165,168,171,
%T A354023 180,189,192,216,243,487,488,489,492,495,504,512,513,540,567,576,648,
%U A354023 729,1459,1460,1461,1464,1467,1476,1485,1512,1536,1539
%N A354023 Terms m of A351467 such that A005245(m) == 0 (mod 3).
%C A354023 m appears in this list if and only if m>1 and it can be written as 2^p*3^r for p in {0,3,6,9} or as 2(3^r+1)3^s (r>0) or (2*3^r+1)3^s.
%H A354023 Harry Altman, <a href="https://doi.org/10.2140/moscow.2019.8.193">Integer Complexity: The Integer Defect</a>, Moscow Journal of Combinatorics and Number Theory 8-3 (2019), 193-217; <a href="https://arxiv.org/abs/1804.07446">arXiv:1804.07446 [math.NT]</a>, 2018.
%Y A354023 Cf. A351467, A350723, A005245, A354024, A354025.
%K A354023 easy,nonn
%O A354023 1,1
%A A354023 _Harry Altman_, May 14 2022