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.

A330301 Number of chains of binary reflexive matrices of order n.

Original entry on oeis.org

1, 1, 11, 18731, 112366270379, 10710751184977536812459, 45614275176047521934969856784739607851, 19643251901558299817275038399757555422179135786779642874411
Offset: 0

Views

Author

S. R. Kannan, Rajesh Kumar Mohapatra, Jan 01 2020

Keywords

Comments

Also, the number of chains in the power set of (n^2-n) elements.
a(n) is the number of distinct n X n reflexive fuzzy matrices.

References

  • S. Nkonkobe and V. Murali, A study of a family of generating functions of Nelsen-Schmidt type and some identities on restricted barred preferential arrangements, Discrete Math., Vol. 340(5) (2017), pp. 1122-1128.

Crossrefs

Programs

  • Maple
    # P are the polynomials defined in A007047.
    a := n -> 2^(n^2-n)*subs(x=1/2, P(n^2-n, x)):
    seq(a(n), n=0..7);
  • Mathematica
    Array[2 PolyLog[-(#^2-#), 1/2] - 1 &, 8, 0]
    Table[2*PolyLog[-(n^2-n), 1/2] - 1, {n, 0, 19}]
    Table[LerchPhi[1/2, -(n^2-n), 2]/2, {n, 0, 9}]

Formula

a(n) = A007047(n^2-n).