cp's OEIS Frontend

A206902 Number of nonisomorphic graded posets with 0 and uniform Hasse diagram of rank n with no 3-element antichain.

%I A206902 #41 Sep 08 2022 08:46:01
%S A206902 1,2,8,36,166,768,3554,16446,76102,352152,1629536,7540458,34892452,
%T A206902 161460114,747134894,3457265922,15998031616,74028732924,342557973998,
%U A206902 1585140808368,7335025230994,33941839649382,157061283704438,726779900373936,3363075935260696
%N A206902 Number of nonisomorphic graded posets with 0 and uniform Hasse diagram of rank n with no 3-element antichain.
%C A206902 We do not assume all maximal elements have maximal rank and thus use graded poset to mean: For every element x, all maximal chains among those with x as greatest element have the same finite length.
%C A206902 Uniform (in the definition) used in the sense of Retakh, Serconek and Wilson (see paper in Links lines). - _David Nacin_, Mar 01 2012
%H A206902 Vincenzo Librandi, <a href="/A206902/b206902.txt">Table of n, a(n) for n = 0..1000</a>
%H A206902 V. Retakh, S. Serconek and R. Wilson, <a href="http://arxiv.org/abs/1010.6295">Hilbert Series of Algebras Associated to Directed Graphs and Order Homology</a>, arXiv:1010.6295 [math.RA], 2010-2011.
%H A206902 Wikipedia, <a href="http://en.wikipedia.org/wiki/Graded_poset">Graded poset</a>
%H A206902 <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (6,-7,3).
%F A206902 a(n) = 6*a(n-1) - 7*a(n-2) + 3*a(n-3), a(1)=2, a(2)=8, a(3)=36.
%F A206902 G.f.: (1 -4*x +3*x^2 -x^3)/(1 -6*x +7*x^2 -3*x^3).
%t A206902 LinearRecurrence[{6,-7,3}, {1,2,8,36}, 30] (* _Vincenzo Librandi_, Feb 27 2012 *)
%o A206902 (Python)
%o A206902 def a(n, adict={1:2,2:8,3:36}):
%o A206902     if n in adict:
%o A206902         return adict[n]
%o A206902     adict[n]=6*a(n-1)-7*a(n-2)+3*a(n-3)
%o A206902     return adict[n]
%o A206902 (PARI) my(x='x+O('x^30)); Vec((1-4*x+3*x^2-x^3)/(1-6*x+7*x^2-3*x^3)) \\ _G. C. Greubel_, May 21 2019
%o A206902 (Magma) R<x>:=PowerSeriesRing(Integers(), 30); Coefficients(R!( (1-4*x +3*x^2-x^3)/(1-6*x+7*x^2-3*x^3) )); // _G. C. Greubel_, May 21 2019
%o A206902 (Sage) ((1-4*x+3*x^2-x^3)/(1-6*x+7*x^2-3*x^3)).series(x, 30).coefficients(x, sparse=False) # _G. C. Greubel_, May 21 2019
%o A206902 (GAP) a:=[2,8,36];; for n in [4..30] do a[n]:=6*a[n-1]-7*a[n-2]+3*a[n-3]; od; Concatenation([1], a); # _G. C. Greubel_, May 21 2019
%Y A206902 Cf. A025192 (adding a unique maximal element).
%Y A206902 Cf. A124292, A206901 (dropping uniformity with and without maximal element).
%K A206902 nonn,easy
%O A206902 0,2
%A A206902 _David Nacin_, Feb 13 2012