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.
%I A359376 #16 Jan 24 2023 02:50:30
%S A359376 0,3,4,8,9,12,15,16,20,21,24,27,28,32,33,36,39,40,44,45,48,51,52,56,
%T A359376 57,60,63,64,68,69,72,75,76,80,81,84,87,88,92,93,96,99,100,104,105,
%U A359376 108,111,112,116,117,120,123,124,128,129,132,135,136,140,141,144,147,148,152,153,156,159,160,164,165
%N A359376 Numbers that are either odd multiples of 3 or multiples of 4. Numbers k such that A252463(k) is even.
%C A359376 Numbers that are congruent to {0, 3, 4, 8, 9} mod 12. - _Amiram Eldar_, Jan 24 2023
%H A359376 Amiram Eldar, <a href="/A359376/b359376.txt">Table of n, a(n) for n = 1..10000</a>
%H A359376 <a href="/index/Rec#order_06">Index entries for linear recurrences with constant coefficients</a>, signature (1,0,0,0,1,-1).
%t A359376 Select[Range[0, 165], Mod[#, 6] == 3 || Mod[#, 4] == 0 &] (* _Amiram Eldar_, Jan 24 2023 *)
%o A359376 (PARI) isA359376(n) = A359379(n);
%o A359376 (PARI) isA359376(n) = !A359374(n);
%o A359376 (PARI) isA359376(n) = (((n%2)&&!(n%3))||!(n%4));
%Y A359376 Disjoint union of A016945 and A008586.
%Y A359376 Cf. A000035, A064989, A252463, A359375 (complement), A359379 (characteristic function).
%Y A359376 Positions of 0's in A359374.
%K A359376 nonn,easy
%O A359376 1,2
%A A359376 _Antti Karttunen_, Dec 31 2022