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 A274197 #5 Jun 16 2016 21:41:31 %S A274197 1,2,3,4,5,7,9,11,13,17,21,25,30,38,46,55,67,83,100,121,148,180,217, %T A274197 264,321,388,470,572,693,838,1018,1237,1497,1814,2205,2675,3239,3930, %U A274197 4773,5785,7010,8510,10326,12514,15177,18422,22340,27084,32862,39872,483458 %N A274197 Row sums of the array A274196, defined by 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. %C A274197 See A274198 for the limit of a(n)/a(n-1). %e A274197 (g(7,k)) = (1,2,2,2,1,1,1,1), so that a(7) = 11. %t A274197 z = 150; g[n_, 0] = g[n, 0] = 1; %t A274197 g[n_, k_] := g[n, k] = If[k > n, 0, g[n - 1, k - 1] + g[n - 1, 4 k]]; %t A274197 t = Table[g[n, k], {n, 0, z}, {k, 0, n}]; w = Map[Total, t]; %Y A274197 Cf. A274196, A274198. %K A274197 nonn,easy %O A274197 0,2 %A A274197 _Clark Kimberling_, Jun 16 2016