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 A011829 #23 Sep 16 2020 05:00:13 %S A011829 2,3,5,10,26,96,552,4908,48230,398663,2631241,14192097,64663638, %T A011829 256174350,902972232,2883651027,8463753978,23094833355,59133598085, %U A011829 143164108028,329810868994,726833391860,1539215246944,3144340388550 %N A011829 Number of f-vectors for simplicial complexes of dimension at most 4 on at most n-1 vertices. %C A011829 Apparently a polynomial (n^15)/32659200 + .... [_Frank Ellermann_] %D A011829 D. E. Knuth, The Art of Computer Programming, vol. 4A, Combinatorial Algorithms, Section 7.2.1.3 (p. 743). %D A011829 S. Linusson, The number of M-sequences and f-vectors, Combinatorica, 19 (1999), 255-266. %F A011829 Empirical G.f.: -x*(x^15 -16*x^14 +114*x^13 -1154*x^12 -2541*x^11 -16919*x^10 -6585*x^9 -17282*x^8 +9460*x^7 -8548*x^6 +5196*x^5 -2426*x^4 +830*x^3 -197*x^2 +29*x -2)/(x -1)^16. [_Colin Barker_, Sep 18 2012] %Y A011829 Cf. A011828, A011830, A011831, A011832, A011833, A007695. %K A011829 nonn %O A011829 1,1 %A A011829 Svante Linusson (linusson(AT)math.kth.se)