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 A097207 #18 Jul 26 2015 10:14:10
%S A097207 1,1,3,1,4,5,1,5,9,7,1,6,14,16,9,1,7,20,30,25,11,1,8,27,50,55,36,13,1,
%T A097207 9,35,77,105,91,49,15,1,10,44,112,182,196,140,64,17,1,11,54,156,294,
%U A097207 378,336,204,81,19,1,12,65,210,450,672,714,540,285,100,21,1,13,77,275,660
%N A097207 Triangle read by rows: T(n,k) = binomial(n,k) + 2*binomial(n,k-1).
%H A097207 Reinhard Zumkeller, <a href="/A097207/b097207.txt">Rows n=0..150 of triangle, flattened</a>
%H A097207 H. W. Gould, <a href="http://dx.doi.org/10.1137/0117030">Power sum identities for arbitrary symmetric arrays</a>, SIAM J. Appl. Math., 17 (1969), 307-316.
%H A097207 <a href="/index/Pas#Pascal">Index entries for triangles and arrays related to Pascal's triangle</a>
%F A097207 T(n,k) = A029635(n+1,k), 0 <= k <= n. - _Reinhard Zumkeller_, Mar 12 2012
%e A097207 Triangle begins:
%e A097207 1
%e A097207 1 3
%e A097207 1 4 5
%e A097207 1 5 9 7
%e A097207 1 6 14 16 9
%t A097207 T[n_, k_] := Binomial[n, k] + 2Binomial[n, k - 1]; Flatten[ Table[ T[n, k], {n, 0, 10}, {k, 0, n}]] (* _Robert G. Wilson v_, Sep 21 2004 *)
%o A097207 (Haskell)
%o A097207 a097207 n k = a097207_tabl !! n !! k
%o A097207 a097207_row n = a097207_tabl !! n
%o A097207 a097207_tabl = map init $ tail a029635_tabl
%o A097207 -- _Reinhard Zumkeller_, Mar 12 2012
%Y A097207 Cf. A029637, A110813 (row-reversed).
%K A097207 nonn,tabl,easy
%O A097207 0,3
%A A097207 _N. J. A. Sloane_, Sep 21 2004
%E A097207 More terms from _Robert G. Wilson v_, Sep 21 2004