cp's OEIS Frontend

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.

Previous Showing 11-13 of 13 results.

A330032 The number of chains of strictly rooted upper triangular or lower triangular matrices of order n.

Original entry on oeis.org

1, 2, 26, 9366, 204495126, 460566381955706, 162249649997008147763642, 12595124129900132067036747870669270, 288398561903310939256721956218813835167026180310, 2510964964470962082968627390938311899485883615067802615950711482
Offset: 0

Views

Author

S. R. Kannan, Rajesh Kumar Mohapatra, Feb 29 2020

Keywords

Comments

Also, the number of chains in the power set of (n^2-n)/2-elements such that the first term of the chains is either an empty set or a set of (n^2-n)/2-elements.
The number of rooted chains of 2-element subsets of {0,1, 2, ..., n} that contain no consecutive integers.
The number of distinct rooted reflexive symmetric fuzzy matrices of order n.
The number of chains in the set consisting of all n X n reflexive symmetric matrices such that the first term of the chains is either reflexive symmetric matrix or unit matrix.

Crossrefs

Formula

a(n) = A000629((n^2-n)/2).

Extensions

Missing term a(6) = 162249649997008147763642 inserted by Georg Fischer, Jul 15 2024

A329712 The number of rooted chains in the lattice of (0, 1) matrices of order n.

Original entry on oeis.org

1, 2, 150, 14174522, 10631309363962710, 213394730876951551651166996282, 288398561903310939256721956218813835167026180310, 55313586130829865212025793302979452922870356482030868613037427298852922
Offset: 0

Views

Author

S. R. Kannan, Rajesh Kumar Mohapatra, Feb 29 2020

Keywords

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.

Crossrefs

Formula

a(n) = A000629(n^2).

A329911 The number of rooted chains of reflexive matrices of order n.

Original entry on oeis.org

1, 1, 6, 9366, 56183135190, 5355375592488768406230, 22807137588023760967484928392369803926, 9821625950779149908637519199878777711089567893389821437206
Offset: 0

Views

Author

S. R. Kannan, Rajesh Kumar Mohapatra, Feb 29 2020

Keywords

Comments

Also, the number of n X n distinct rooted reflexive fuzzy matrices.
The number of chains in the power set of (n^2-n)-elements such that the first term of the chains is either an empty set or a set of (n^2-n)-elements.
The number of chains in the collection of all reflexive matrices of order n such that the first term of the chains is either identity matrix or unit matrix.

Crossrefs

Formula

a(n) = A000629(n^2-n).
Previous Showing 11-13 of 13 results.