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.

A373262 Numbers k for which A276085(k) == -1 (mod 3), where A276085 is the primorial base log-function.

This page as a plain text file.
%I A373262 #16 Jul 19 2024 08:45:51
%S A373262 3,4,15,18,20,21,24,28,32,33,39,44,51,52,57,68,69,75,76,81,87,90,92,
%T A373262 93,100,105,108,111,116,120,123,124,126,129,140,141,144,147,148,159,
%U A373262 160,164,165,168,172,177,183,188,192,195,196,198,201,212,213,219,220,224,231,234,236,237,244,249,255,256,260,264,267
%N A373262 Numbers k for which A276085(k) == -1 (mod 3), where A276085 is the primorial base log-function.
%C A373262 Numbers k such that the 2-adic valuation of k minus the 3-adic valuation of k is equal to -1 modulo 3.
%C A373262 When terms are multiplied by 2, forms a subsequence of A339746 (its even terms), and when multiplied by 3, forms a subsequence of A373261 (its multiples of 3).
%C A373262 More widely stated, the sequence lists one part of a 3-part partition of the positive integers with a symmetric relationship between the parts (further explained in the 2021 comment in A339746). - _Peter Munn_, Jul 19 2024
%H A373262 Antti Karttunen, <a href="/A373262/b373262.txt">Table of n, a(n) for n = 1..10000</a>
%F A373262 {k such that A007814(k)-A007949(k) == -1 (mod 3)}.
%o A373262 (PARI) isA373262 = A373263;
%Y A373262 Cf. A007814, A007949, A276085, A373263 (characteristic function).
%Y A373262 Positions of -1's in A373153.
%Y A373262 The positive integers are partitioned between A339746, A373261, and this sequence.
%K A373262 nonn
%O A373262 1,1
%A A373262 _Antti Karttunen_, May 30 2024