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 A163866 #15 Jan 25 2019 08:30:18
%S A163866 1,2,3,4,6,7,8,11,14,15,16,20,26,30,31,32,37,47,57,62,63,64,70,85,105,
%T A163866 120,126,127,128,135,156,191,226,247,254,255,256,264,292,348,418,474,
%U A163866 502,510,511,512,521,557,641,767,893,977,1013,1022,1023,1024,1034,1079,1199
%N A163866 Partial sums of A007318.
%H A163866 Harvey P. Dale, <a href="/A163866/b163866.txt">Table of n, a(n) for n = 1..1000</a>
%H A163866 <a href="/index/Pas#Pascal">Index entries for triangles and arrays related to Pascal's triangle</a>
%F A163866 a(n) = Sum_{j=1..n-1} A007318(j).
%e A163866 a(1)=0!/(0!(0-0)!)=1.
%t A163866 Flatten[Table[2^a-1+Sum[Binomial[a,p],{p,0,b}],{a,0,10},{b,0,a}]] (* _Frank M Jackson_, Apr 25 2011 *)
%t A163866 Accumulate[Flatten[Table[Binomial[n,k],{n,0,11},{k,0,n}]]] (* _Harvey P. Dale_, Dec 04 2012 *)
%o A163866 (Haskell)
%o A163866 a163866 n = a163866_list !! (n-1)
%o A163866 a163866_list = scanl1 (+) $ concat a007318_tabl
%o A163866 -- _Reinhard Zumkeller_, Jul 18 2015
%o A163866 (PARI) lista(nn) = {my(i=0, j=0, p=0); for (n=1, nn, p += binomial(i, j); print1(p, ", "); j++; if (j > i, j = 0; i++););} \\ _Michel Marcus_, Jan 25 2019
%Y A163866 Cf. A007318, A008949.
%Y A163866 Cf. A259525.
%K A163866 nonn
%O A163866 1,2
%A A163866 _Juri-Stepan Gerasimov_, Aug 06 2009
%E A163866 Entries checked by _R. J. Mathar_, Aug 11 2009