A354024 -id:A354024 - cp's OEIS frontend

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

Harry Altman, May 14 2022

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.

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.

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

A354025 Terms m of A351467 such that A005245(m) == 2 (mod 3).

Original entry on oeis.org

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

Offset: 1

Harry Altman, May 14 2022

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.

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.

Cf. A351467, A350723, A005245, A354023, A354024.

cp's OEIS Frontend

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

Views

Author

Keywords

Comments

Links

Crossrefs