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 A103449 #13 Jun 18 2021 07:25:12
%S A103449 3,12,24,29,34,40,54,60,67,68,75,86,93,97,102,119,125,131,133,142,152,
%T A103449 157,160,163,164,168,170,172,189,193,197,208,210,220,221,228,229,246,
%U A103449 251,255,257,261,270,275,280,293,296,307,308,313,315,332,337,338,340
%N A103449 Values of k such that Sum_{m=0..k} Moebius(binomial(k,m)) = 0.
%C A103449 Values of k such that A103448(k) = 0.
%H A103449 G. C. Greubel, <a href="/A103449/b103449.txt">Table of n, a(n) for n = 1..1000</a>
%e A103449 12 belongs to the sequence because the only squarefree values of binomial(12,m) are 1, 2*3*11, 2*3*11, 1, on which the Mobius function takes the values 1,-1,-1,1, respectively.
%e A103449 8 does not belong to the sequence because the only squarefree value of binomial(8,m) are 1, 2*5*7, 1, on which the Moebius function takes the values 1,-1,1, respectively.
%t A103449 A103448[n_]:= A103448[n]= Sum[MoebiusMu[Binomial[n, k]], {k, 0, n}];
%t A103449 f:= Table[A103448[n], {n, 0, 1050}];
%t A103449 Select[Range[0, 1000], f[[#]] == 0 &] - 1 (* _G. C. Greubel_, Jun 17 2021 *)
%o A103449 (PARI) is(k) = sum(m=0, k, moebius(binomial(k, m)))==0 \\ _Felix Fröhlich_, Jun 18 2021
%Y A103449 Cf. A008683, A103447, A103448.
%K A103449 nonn
%O A103449 1,1
%A A103449 _Emeric Deutsch_, Feb 07 2005