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 A173522 #19 Feb 24 2021 02:48:19
%S A173522 0,1,4,8,14,20,26,34,46,56,62,70,82,94,106,122,146,164,170,178,190,
%T A173522 202,214,230,254,274,286,302,326,350,374,406,454,488,494,502,514,526,
%U A173522 538,554,578,598,610,626,650,674,698,730,778,814,826,842,866,890,914,946
%N A173522 Zero together with the partial sums of A105321.
%H A173522 Shawn A. Broyles, <a href="/A173522/b173522.txt">Table of n, a(n) for n = 0..10000</a>
%H A173522 David Applegate, Omar E. Pol and N. J. A. Sloane, <a href="/A000695/a000695_1.pdf">The Toothpick Sequence and Other Sequences from Cellular Automata</a>, Congressus Numerantium, Vol. 206 (2010), 157-191. [There is a typo in Theorem 6: (13) should read u(n) = 4.3^(wt(n-1)-1) for n >= 2.]
%H A173522 T. Pisanski and T. W. Tucker, <a href="http://www.imfm.si/preprinti/PDF/00696.pdf">Growth in Repeated Truncations of Maps</a>, Preprint series, Univ. of Ljubljana, Vol. 38 (2000), 696.
%H A173522 N. J. A. Sloane, <a href="/wiki/Catalog_of_Toothpick_and_CA_Sequences_in_OEIS">Catalog of Toothpick and Cellular Automata Sequences in the OEIS</a>
%t A173522 f[n_] := f[n] = Sum[ Binomial[1, n - k]Mod[ Binomial[k, j], 2], {k, 0, n}, {j, 0, k}]; g[n_] := Sum[ f@k, {k, 0, n}]; Array[g, 55, 0] (* _Robert G. Wilson v_, Jun 28 2010 *)
%o A173522 (PARI) f(n) = sum(k=0, n, binomial(1, n-k)*sum(j=0, k, binomial(k, j) % 2));
%o A173522 a(n) = if (n==0, 0, sum(k=0, n-1, f(k))); \\ or
%o A173522 lista(nn) = {print1(s=0, ", "); for (n=0, nn-1, s += f(n); print1(s, ", "););} \\ _Michel Marcus_, Apr 29 2018
%Y A173522 Cf. A105321, A139250, A173537.
%K A173522 nonn
%O A173522 0,3
%A A173522 _Omar E. Pol_, May 29 2010
%E A173522 More terms from _Robert G. Wilson v_, Jun 28 2010