A354024 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

A354024

Terms m > 1 of A351467 such that A005245(m) == 1 (mod 3).

4, 10, 12, 28, 30, 32, 36, 82, 84, 90, 96, 108, 244, 246, 252, 256, 270, 288, 324, 730, 732, 738, 756, 768, 810, 864, 972, 2188, 2190, 2196, 2214, 2268, 2304, 2430, 2592, 2916, 6562, 6564, 6570, 6588, 6642, 6804, 6912, 7290, 7776, 6588

(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 {2,5,8} or as (3^r+1)3^s for r > 1.

LINKS

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

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, A354023, A354025.

Sequence in context: A007319 A352213 A175436 * A074939 A038464 A366633

Adjacent sequences: A354021 A354022 A354023 * A354025 A354026 A354027

KEYWORD

easy,nonn

AUTHOR

Harry Altman, May 14 2022

STATUS

approved