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 A206425 #24 Feb 16 2022 11:14:49
%S A206425 0,0,1,0,0,2,1,2,4,0,0,2,0,0,4,2,4,8,1,2,4,2,4,8,1,2,4,2,4,8,4,8,13,0,
%T A206425 0,2,0,0,4,2,4,8,0,0,4,0,0,8,4,8,16,2,4,8,4,8,16,8,16,26,1,2,4,2,4,8,
%U A206425 4,8,13,2,4,8,4,8,16,8,16,26,4,8,13,8,16,26
%N A206425 Erroneous version of A227428.
%C A206425 A006047(n) = A206424(n) + a(n).
%H A206425 Marcus Jaiclin, et al. <a href="https://web.archive.org/web/20170823000349/http://pyrrho.wsc.ma.edu/math/faculty/jaiclin/writings/research/pascals_triangle/">Pascal's Triangle, Mod 2,3,5</a>
%e A206425 Example: Rows 0-8 of Pascal's Triangle (mod 3) are:
%e A206425 1 So a(0) = 0
%e A206425 1 1 So a(1) = 0
%e A206425 1 2 1 So a(2) = 1
%e A206425 1 0 0 1 .
%e A206425 1 1 0 1 1 .
%e A206425 1 2 1 1 2 1 .
%e A206425 1 0 0 2 0 0 1
%e A206425 1 1 0 2 2 0 1 1
%e A206425 1 2 1 2 1 2 1 2 1
%t A206425 Table[Count[Mod[Binomial[n, Range[0, n]], 3], 2], {n, 0, 99}] (* _Alonso del Arte_, Feb 07 2012 *)
%Y A206425 Cf. A083093, A062296, A006047.
%K A206425 dead
%O A206425 0,6
%A A206425 _Marcus Jaiclin_, Feb 07 2012