This site is supported by donations to The OEIS Foundation.
User:Rajesh Kumar Mohapatra
From OeisWiki
Personal Details
Born in 1994.
Ph.D. in Mathematics, Pondicherry University-605014
I have joined OEIS in October 2019.
- Email Id: mohapatrarajesh030@gmail.com
Publications listed in:
Interests
- Basic Combinatorics (enumeration)
- Matrix Theory
- Partition Theory
- Fuzzy Set Theory and Its Applications
Approved Sequences (14)
- A328044: Number of chains of binary matrices of order n.
- A329712: The number of rooted chains in the lattice of (0, 1) matrices of order n.
- A330301: Number of chains of binary reflexive matrices of order n.
- A329911: The number of rooted chains of reflexive matrices of order n.
- A330302: Number of chains of 2-element subsets of {0,1, 2, ..., n} that contain no consecutive integers.
- A330032: The number of chains of strictly rooted upper triangular or lower triangular matrices of order n.
- A331955: Triangle T(n,k) of number of chains of length k in partitions of an n-set ordered by refinement.
- A330804: Number of chains in partitions of [n] ordered by refinement.
- A331956: Triangle T(n,k) read by rows: number of rooted chains of length k in set partitions of n labeled points.
- A331957: Number of rooted chains in set partitions of {1, 2, ..., n}.
- A375835: Triangle read by rows: T(n, k) is the number of chains of length k in the poset of permutations of an n-set.
- A375836: Number of chains in the poset of permutations of [n].
- A375837: Triangle read by rows: T(n,k) is the number of rooted chains starting with the cycle (1)(2)(3)...(n) of length k of permutation poset of n letters.
- A375838: Number of rooted chains starting with the cycle (1)(2)(3)...(n) in the permutation poset of [n].
Comments/Edits On Sequences (3)
- A038719: Triangle T(n,k) (0<=k<=n) giving number of chains of length k in partially ordered set formed from subsets of n-set by inclusion.
- A005461: Number of simplices in barycentric subdivision of n-simplex.
- A028246: Triangular array a(n,k) = (1/k)*Sum_{i=0..k} (-1)^(k-i)*binomial(k,i)*i^n; n >= 1, 1 <= k <= n, read by rows.