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 A114572 #4 Aug 08 2015 23:57:49 %S A114572 2,1,2,6,27,185,2135,55129 %N A114572 Number of "ultrasweet" Boolean functions of n variables which depend on all the variables. %C A114572 Inverse binomial transform of A114491. %C A114572 This sequence enumerates a certain type of matroid, except for the first entry (which is 2 instead of 1). If the first entry is changed from 2 to 1, giving A118085, this enumerates "combinatorial geometries" on n labeled points. %C A114572 These are matroids in which no element has rank 0; equivalently, all one-element sets are independent; equivalently, the closure of the empty set is empty. %C A114572 These are called "simple matroids" in A002773. So A118085 is the "labeled" equivalent of that sequence, which counts unlabeled points. %e A114572 For all n>1, a function like "x2" is counted in A114491 but not in the present sequence. %Y A114572 Cf. A114302, A114303, A114491, A118085, A002773. %K A114572 nonn %O A114572 0,1 %A A114572 _Don Knuth_, Aug 17 2008, Oct 14 2008