login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A329712 The number of rooted chains in the lattice of (0, 1) matrices of order n. 0
1, 2, 150, 14174522, 10631309363962710, 213394730876951551651166996282, 288398561903310939256721956218813835167026180310, 55313586130829865212025793302979452922870356482030868613037427298852922 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
COMMENTS
Also, the number of n X n distinct rooted fuzzy matrices.
The number of chains in the power set of n^2-elements such that the first term of the chains is either an empty set or a set of n^2-elements.
The number of chains in the collection of all binary (crisp or Boolean or logical) matrices of order n such that the first term of the chains is either null matrix or unit matrix.
LINKS
S. R. Kannan and Rajesh Kumar Mohapatra, Counting the Number of Non-Equivalent Classes of Fuzzy Matrices Using Combinatorial Techniques, arXiv preprint arXiv:1909.13678 [math.GM], 2019.
V. Murali and B. Makamba, Finite Fuzzy Sets, Int. J. Gen. Syst., Vol. 34 (1) (2005), pp. 61-75.
R. B. Nelsen and H. Schmidt, Jr., Chains in power sets, Math. Mag., 64 (1) (1991), 23-31.
M. Tărnăuceanu, The number of chains of subgroups of a finite elementary abelian p-group, arXiv preprint arXiv:1506.08298 [math.GR], 2015.
FORMULA
a(n) = A000629(n^2).
CROSSREFS
Sequence in context: A141139 A141130 A157074 * A128350 A046473 A261967
KEYWORD
nonn
AUTHOR
S. R. Kannan, Rajesh Kumar Mohapatra, Feb 29 2020
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 10 13:34 EDT 2024. Contains 372387 sequences. (Running on oeis4.)