login

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”).

A354024
Terms m > 1 of A351467 such that A005245(m) == 1 (mod 3).
2
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
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
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
KEYWORD
easy,nonn
AUTHOR
Harry Altman, May 14 2022
STATUS
approved