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 A322062 #16 Jan 27 2019 09:41:51
%S A322062 2,2,2,3,3,2,4,6,4,2,5,10,10,5,2,6,15,20,15,6,2,7,21,35,35,21,7,2,8,
%T A322062 28,56,70,56,28,8,2,9,36,84,126,126,84,36,9,2,10,45,120,210,252,210,
%U A322062 120,45,10,2,11,55,165,330,462,462,330,165,55,11,2,12,66,220,495,792,924,792,495,220,66,12,1
%N A322062 Sums of pairs of consecutive terms of Pascal's triangle read by row.
%C A322062 Sums of pairs of adjacent terms of A007318. - _N. J. A. Sloane_, Jan 27 2019
%F A322062 T(n, k) = if (k<n, binomial(n, k) + binomial(n, k+1), binomial(n, k) + binomial(n+1, 0)). - _Michel Marcus_, Nov 25 2018
%e A322062 The 8th term is 6 because it is the sum of the 8th and 9th terms of Pascal's triangle read by row (3 + 3).
%e A322062 Triangle begins:
%e A322062 2;
%e A322062 2, 2;
%e A322062 3, 3, 2;
%e A322062 4, 6, 4, 2;
%e A322062 5, 10, 10, 5, 2;
%e A322062 ...
%t A322062 v = Flatten[Table[Binomial[n, k], {n, 0, 10}, {k, 0, n}]]; Most[v] + Rest[v] (* _Amiram Eldar_, Nov 25 2018 *)
%o A322062 (PARI) T(n, k) = if (k<n, binomial(n,k) + binomial(n,k+1), binomial(n,k) + binomial(n+1,0));
%o A322062 tabl(nn) = for (n=0, nn, for(k=0, n, print1(T(n,k), ", ")); print); \\ _Michel Marcus_, Nov 25 2018
%Y A322062 Cf. A007318, A168557.
%K A322062 nonn,tabl,easy
%O A322062 0,1
%A A322062 _Kei Ryan_, Nov 25 2018