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 A274196 #5 Jun 16 2016 21:40:14
%S A274196 1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,2,1,1,1,1,1,2,2,1,1,1,1,1,2,2,2,1,1,
%T A274196 1,1,1,2,2,2,2,1,1,1,1,1,3,3,2,2,2,1,1,1,1,1,3,4,3,2,2,2,1,1,1,1,1,3,
%U A274196 4,4,3,2,2,2,1,1,1,1,1,4,4,4,4,3,2,2
%N A274196 Triangular array read by rows: g(n,k) = 1 for n >= 0; g(n,k) = 0 if k > n; g(n,k) = g(n-1,k-1) + g(n-1,4k) for n > 0, k > 1.
%H A274196 Clark Kimberling, <a href="/A274196/b274196.txt">Table of n, a(n) for n = 0..10000</a>
%e A274196 First 10 rows:
%e A274196 1
%e A274196 1 1
%e A274196 1 1 1
%e A274196 1 1 1 1
%e A274196 1 1 1 1 1
%e A274196 1 2 1 1 1 1
%e A274196 1 2 2 1 1 1 1
%e A274196 1 2 2 2 1 1 1 1
%e A274196 1 2 2 2 2 1 1 1 1
%e A274196 1 3 3 2 2 2 1 1 1 1
%t A274196 g[n_, 0] = g[n, 0] = 1;
%t A274196 g[n_, k_] := g[n, k] = If[k > n, 0, g[n - 1, k - 1] + g[n - 1, 4 k]];
%t A274196 t = Table[g[n, k], {n, 0, 14}, {k, 0, n}]
%t A274196 TableForm[t] (* A274196 array *)
%t A274196 u = Flatten[t] (* A274196 sequence *)
%Y A274196 Cf. A274197 (row sums), A274201 (limiting reverse row), A274190.
%K A274196 nonn,tabl,easy
%O A274196 0,17
%A A274196 _Clark Kimberling_, Jun 16 2016