|
%I #33 Jan 31 2021 08:14:10
%S 1,1,2,6,36,380,6390,157962,5396888,243179064,13938711210,
%T 987858368750,84613071940452,8597251494954564,1020353444641839854,
%U 139627532137612581090,21788453795572514675760,3840596246648027262079472,758435490711709577216754642
%N Lattices with n labeled elements.
%H Sean A. Irvine, <a href="/A055512/b055512.txt">Table of n, a(n) for n = 0..19</a> (terms 0..18 from David Wasserman)
%H J. Heitzig and J. Reinhold, <a href="http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.24.2420&rep=rep1&type=pdf">Counting finite lattices</a>, preprint no. 298, Institut für Mathematik, Universität Hanover, Germany, 1999.
%H Sean A. Irvine, <a href="https://github.com/archmageirvine/joeis/blob/master/src/irvine/oeis/a055/A055512.java">Java program</a> (github).
%H J. Heitzig and J. Reinhold, <a href="https://doi.org/10.1007/PL00013837">Counting finite lattices</a>, Algebra univers. 48, 43-53 (2002).
%H D. J. Kleitman and K. J. Winston, <a href="https://doi.org/10.1016/S0167-5060(08)70708-8">The asymptotic number of lattices</a>, in: Combinatorial mathematics, optimal designs and their applications (Proc. Sympos. Combin. Math. and Optimal Design, Colorado State Univ., Fort Collins, Colo., 1978), Ann. Discrete Math. 6 (1980), 243-249.
%H Alan Veliz-Cuba and Reinhard Laubenbacher, <a href="https://doi.org/10.1016/j.automatica.2018.10.031">Dynamics of semilattice networks with strongly connected dependency graph</a>, Automatica (2019) Vol. 99, 167-174.
%H <a href="/index/Cor#core">Index entries for "core" sequences</a>
%Y Cf. A006966, A001035. Main diagonal of A058159.
%K core,hard,nonn,nice
%O 0,3
%A Jobst Heitzig (heitzig(AT)math.uni-hannover.de), Jul 03 2000
|
