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”).
%I #17 Aug 23 2023 12:19:15
%S 2,5,6,13,14,15,16,18,37,38,39,40,42,45,48,54,109,110,111,112,114,117,
%T 120,126,128,135,144,162,325,326,327,328,330,333,336,342,351,360,378,
%U 384,405,432,486,973,974,975,976,978,981,984,990,999
%N Terms m of A351467 such that A005245(m) == 2 (mod 3).
%C 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.
%H 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 Cf. A351467, A350723, A005245, A354023, A354024.
%K easy,nonn
%O 1,1
%A _Harry Altman_, May 14 2022