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 A281776 #21 Aug 03 2021 15:31:53 %S A281776 0,0,0,1,54,955,11760,122941,1175034,10595215,91506420,763624081, %T A281776 6194818014,49084747075,381338401080,2914184784421,21965095364994, %U A281776 163656285828535,1207613518375740,8838842878371961,64253768864671974,464416229729871595,3340518964319750400 %N A281776 Number of distinct topologies on an n-set that have exactly 8 open sets. %H A281776 Colin Barker, <a href="/A281776/b281776.txt">Table of n, a(n) for n = 0..1000</a> %H A281776 Moussa Benoumhani, <a href="https://cs.uwaterloo.ca/journals/JIS/VOL9/Benoumhani/benoumhani11.html">The Number of Topologies on a Finite Set</a>, Journal of Integer Sequences, Vol. 9 (2006), Article 06.2.6. %H A281776 <a href="/index/Rec#order_07">Index entries for linear recurrences with constant coefficients</a>, signature (28,-322,1960,-6769,13132,-13068,5040). %F A281776 a(n) = Stirling2(n, 3) + 2*4! Stirling2(n, 4) + 15/4*5! Stirling2(n, 5) + 5/2*6! Stirling2(n, 6) + 7! Stirling2(n, 7). %F A281776 From _Colin Barker_, Jan 30 2017: (Start) %F A281776 a(n) = 13/4 - 19*2^(n-1) + 44*3^(n-1) - 2^(n-1)*3^(2+n) - 57*4^(n-1) + (39*5^n)/4 + 7^n for n>0. %F A281776 G.f.: x^3*(1 + 26*x - 235*x^2 + 448*x^3 + 2100*x^4) / ((1 - x)*(1 - 2*x)*(1 - 3*x)*(1 - 4*x)*(1 - 5*x)*(1 - 6*x)*(1 - 7*x)). %F A281776 (End) %o A281776 (PARI) concat(vector(3), Vec(x^3*(1 + 26*x - 235*x^2 + 448*x^3 + 2100*x^4) / ((1 - x)*(1 - 2*x)*(1 - 3*x)*(1 - 4*x)*(1 - 5*x)*(1 - 6*x)*(1 - 7*x)) + O(x^30))) \\ _Colin Barker_, Jan 30 2017 %Y A281776 The number of distinct topologies on an n-set with exactly k open sets for k=2..12 is given by A000012, A000918, A281773, A028244, A281774, A281775, A281776, A281777, A281778, A281779, A281780. %K A281776 nonn,easy %O A281776 0,5 %A A281776 _Geoffrey Critzer_, Jan 29 2017