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 A308198 #12 Mar 04 2022 04:20:29
%S A308198 0,2,6,7,9,15,19,20,22,24,26,30,31,33,39,43,46,50,51,53,59,63,64,66,
%T A308198 68,70,74,75,77,81,83,87,88,90,96,100,101,103,105,107,111,112,114,120,
%U A308198 124,127,131,132,134,140,144,145,147,151,155,156,158,164,168,169,171,173,175,179,180,182,188,192,195,199,200,202
%N A308198 Numbers m such that the tribonacci representation of m (A278038) ends in an odd number of 0's.
%C A308198 The asymptotic density of this sequence is 1/(c+1) = 0.352201..., where c = 1.839286... (A058265) is the tribonacci constant. - _Amiram Eldar_, Mar 04 2022
%H A308198 Amiram Eldar, <a href="/A308198/b308198.txt">Table of n, a(n) for n = 1..10000</a>
%t A308198 t[1] = 1; t[2] = 2; t[3] = 4; t[n_] := t[n] = t[n - 1] + t[n - 2] + t[n - 3]; q[0] = True; q[n_] := Module[{s = {}, m = n, k}, While[m > 0, k = 1; While[t[k] <= m, k++]; k--; AppendTo[s, k]; m -= t[k]; k = 1]; OddQ[Min[s] - 1]]; Select[Range[0, 202], q] (* _Amiram Eldar_, Mar 04 2022 *)
%Y A308198 Cf. A278038, A278045, A308197, A058265.
%K A308198 nonn,base
%O A308198 1,2
%A A308198 _N. J. A. Sloane_, Jun 22 2019