cp's OEIS Frontend

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.

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

This page as a plain text file.
%I A354024 #25 Aug 06 2025 16:52:16
%S A354024 4,10,12,28,30,32,36,82,84,90,96,108,244,246,252,256,270,288,324,730,
%T A354024 732,738,756,768,810,864,972,2188,2190,2196,2214,2268,2304,2430,2592,
%U A354024 2916,6562,6564,6570,6588,6642,6804,6912,7290,7776,8748
%N A354024 Terms m > 1 of A351467 such that A005245(m) == 1 (mod 3).
%C A354024 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.
%H A354024 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 A354024 Cf. A351467, A350723, A005245, A354023, A354025.
%K A354024 easy,nonn
%O A354024 1,1
%A A354024 _Harry Altman_, May 14 2022
%E A354024 a(46) corrected by _David Radcliffe_, Aug 04 2025