A354023 Terms m of A351467 such that A005245(m) == 0 (mod 3).

3, 7, 8, 9, 19, 20, 21, 24, 27, 55, 56, 57, 60, 63, 64, 72, 81, 163, 164, 165, 168, 171, 180, 189, 192, 216, 243, 487, 488, 489, 492, 495, 504, 512, 513, 540, 567, 576, 648, 729, 1459, 1460, 1461, 1464, 1467, 1476, 1485, 1512, 1536, 1539

Offset

1,1

Comments

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.

Links

Table of n, a(n) for n=1..50.

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

Cf. A351467, A350723, A005245, A354024, A354025.

Sequence in context: A342006 A239937 A114441 * A043046 A030674 A030684

Adjacent sequences: A354020 A354021 A354022 * A354024 A354025 A354026

Keyword

easy,nonn

Author

Harry Altman, May 14 2022

Status

approved