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.

Showing 1-3 of 3 results.

A353996 Rooted simple digraphs on n unlabeled vertices.

Original entry on oeis.org

1, 4, 36, 752, 45960, 9133760, 6154473664, 14334221970688, 117222686206799936, 3412369204476033220608, 357745172369222114451432448, 136400229481294592916607770361856, 190697841181900458854914389940360337408
Offset: 1

Views

Author

Brendan McKay, May 13 2022

Keywords

Comments

Loops and parallel edges are not permitted.
There are four ways that a vertex other than the root can be joined to the root: only towards, only away, both, neither. Remove the root and color the remaining vertices by four colors corresponding to how they were joined to the root. This gives a bijection with 4-colored digraphs on n-1 vertices, which is A329874(n-1,4).

Crossrefs

Cf. A329874.

Programs

  • Maple
    with(Iterator):
    RootedDig := proc(n)
            local i,j,ptn,ans,a,orb2,orb4,hasptn,nextptn;
       (hasptn,nextptn) := ModuleIterator(PartitionPartCount(n-1));
       ans := 0;
       while hasptn() do
          ptn := nextptn();
          a := 1 / mul(j^ptn[j]*ptn[j]!,j=1..n-1);
          orb2 := add(ptn[j],j=2..n-1,2);
          orb4 := add(ptn[j]*j/2,j=2..n-1,2)
             + add(ptn[j]*(j+1)/2,j=1..n-1,2)
             + add(ptn[j]*(ptn[j]-1)*j/2,j=1..n-1)
             + add(add(ptn[i]*ptn[j]*igcd(i,j),i=1..j-1),j=2..n-1);
          ans := ans + a*2^orb2*4^orb4;
       end do;
       ans;
    end proc;

Formula

a(n) = A329874(n-1,4).

A383617 Triangle read by rows: T(n,k) is the number of binary relations on a set of n objects, k of which are picked out, 0 <= k <= n.

Original entry on oeis.org

1, 2, 2, 10, 16, 10, 104, 272, 272, 104, 3044, 11456, 16960, 11456, 3044, 291968, 1432608, 2842304, 2842304, 1432608, 291968, 96928992, 578431232, 1441700480, 1920352256, 1441700480, 578431232, 96928992, 112282908928, 784780122880, 2351993457920, 3918054495616, 3918054495616, 2351993457920, 784780122880, 112282908928
Offset: 0

Views

Author

Peter Dolland, May 02 2025

Keywords

Comments

The row sums are the number of simple digraphs with n 4-colored nodes. The colors result from the four cases combining the property self-referencing (yes/no) with "picked out" (yes/no).

Examples

			Triangle starts:
            1;
            2,            2;
           10,           16,            10;
          104,          272,           272,           104;
         3044,        11456,         16960,         11456,          3044;
       291968,      1432608,       2842304,       2842304,       1432608,  291968;
     96928992,    578431232,    1441700480,    1920352256,    1441700480, ...
 112282908928, 784780122880, 2351993457920, 3918054495616, 3918054495616, ...
...
Example n=2, k=1: The both objects are differentiated. As a consequence all binary relations on two different objects have to be counted: These are the subsets of the cross product of the objects set with itself. This contains four pairs, so the number of subsets is 2^4 = 16.
		

Crossrefs

Cf. A000595 (edge cases), A353996 (row sums), A329874 (4th column = row sums).

Formula

T(n,k) = T(n,n-k).
T(n,0) = T(n,n) = A000595(n).
Sum_{k=0..n} T(n,k) = A353996(n+1) = A329874(n,4).

A384105 Triangle read by rows: T(n,k) is the number of binary relations on a set of n objects, exactly k of which are self referencing, 0 <= k <= n.

Original entry on oeis.org

1, 1, 1, 3, 4, 3, 16, 36, 36, 16, 218, 752, 1104, 752, 218, 9608, 45960, 90416, 90416, 45960, 9608, 1540944, 9133760, 22692704, 30194176, 22692704, 9133760, 1540944, 882033440, 6154473664, 18425858880, 30679088480, 30679088480, 18425858880, 6154473664, 882033440
Offset: 0

Views

Author

Peter Dolland, May 19 2025

Keywords

Comments

Also the number of essentially different simple digraphs on a node set A of size n with a distinguished subset B of size k, where elements are indistinguishable within B and within A \ B.

Examples

			Triangle starts:
            1
            1,              1
            3,              4,              3
           16,             36,             36,              16
          218,            752,           1104,             752,             218
         9608,          45960,          90416,           90416,           45960, ...
      1540944,        9133760,       22692704,        30194176,        22692704, ...
    882033440,     6154473664,    18425858880,     30679088480,     30679088480, ...
1793359192848, 14334221970688, 50138592081152, 100240050239744, 125284653092864, ...
...
		

Crossrefs

Cf. A000273 (edge cases), A000595 (row sums), A353996, A328874, A383617.

Formula

T(n,k) = T(n,n-k).
T(n,0) = T(n,n) = A000273(n).
T(n,1) = T(n,n-1) = A353996(n+1) = A329874(n,4).
Sum_{k=0..n} T(n,k) = A000595(n).
Showing 1-3 of 3 results.