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 A109995 #10 Sep 03 2024 21:00:39
%S A109995 1,1,1,2,5,18,86,549,4647,52060,772976,15240116,400345371,14063594530,
%T A109995 663256392496,42161077371566,3625838175218123,423372648479289300,
%U A109995 67333725775723184308,14628921614102655999804,4352732830667872529962044
%N A109995 Number of unlabeled ordered minimal T_0-covers of an n-set, cf. A094545.
%H A109995 G. C. Greubel, <a href="/A109995/b109995.txt">Table of n, a(n) for n = 0..119</a>
%F A109995 a(n) = Sum_{m=0..n} binomial(2^m-m-1, n-m).
%t A109995 Table[Sum[Binomial[2^m-m-1, n-m], {m,0,n}], {n, 0, 50}] (* _G. C. Greubel_, Oct 08 2017 *)
%o A109995 (PARI) for(n=0,50, print1(sum(m=0,n, binomial(2^m -m -1, n-m)), ", ")) \\ _G. C. Greubel_, Oct 08 2017
%K A109995 easy,nonn
%O A109995 0,4
%A A109995 Goran Kilibarda, _Vladeta Jovovic_, Sep 01 2005