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 A135635 #6 Oct 25 2016 03:10:44
%S A135635 2,3,5,5,8,10,7,13,18,17,9,20,31,35,26,11,29,51,66,61,37,13,40,80,117,
%T A135635 127,98,50,15,53,120,197,244,225,148,65,17,68,173,317,441,469,373,213,
%U A135635 82,19,85,241,490,758,910,842,586,295,101
%N A135635 Triangle read by rows, constructed by the Pascal rule, with top entry 2, left edge = odd numbers, right edge = squares plus 1.
%H A135635 G. C. Greubel, <a href="/A135635/b135635.txt">Table of n, a(n) for the first 25 rows</a>
%e A135635 ............2
%e A135635 ...........3.5
%e A135635 ..........5.8.10
%e A135635 ........7.13.18.17
%e A135635 .......9.20.31.35.26
%e A135635 .....11.29.51.66.61.37
%p A135635 T:=proc(n,k)if n=1 and k=1 then 2 elif k=1 then 2*n-1 elif n < k then 0 elif k =n then n^2+1 else T(n-1,k)+T(n-1,k-1) end if end proc: for n to 10 do seq(T(n,k),k=1..n) end do; # yields sequence in triangular form - _Emeric Deutsch_, Mar 03 2008
%t A135635 T[1, 1]:= 2; T[n_, 1]:= 2*n - 1; T[n_, n_]:= n^2 + 1; T[n_, k_] := T[n - 1, k] + T[n - 1, k - 1]; Table[T[n, k], {n, 1, 10}, {k, 1, n}]//Flatten (* _G. C. Greubel_, Oct 25 2016 *)
%Y A135635 Cf. A002522.
%K A135635 nonn,tabl
%O A135635 1,1
%A A135635 David Williams (davidwilliams(AT)paxway.com), Mar 01 2008
%E A135635 More terms from _Emeric Deutsch_, Mar 03 2008