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.

A001930 Number of topologies, or transitive digraphs with n unlabeled nodes.

Original entry on oeis.org

1, 1, 3, 9, 33, 139, 718, 4535, 35979, 363083, 4717687, 79501654, 1744252509, 49872339897, 1856792610995, 89847422244493, 5637294117525695
Offset: 0

Views

Author

Keywords

Examples

			From _Gus Wiseman_, Aug 02 2019: (Start)
Non-isomorphic representatives of the a(0) = 1 through a(3) = 9 topologies:
  {}  {}{1}  {}{12}        {}{123}
             {}{2}{12}     {}{3}{123}
             {}{1}{2}{12}  {}{23}{123}
                           {}{1}{23}{123}
                           {}{3}{23}{123}
                           {}{2}{3}{23}{123}
                           {}{3}{13}{23}{123}
                           {}{2}{3}{13}{23}{123}
                           {}{1}{2}{3}{12}{13}{23}{123}
(End)
		

References

  • Loic Foissy, Claudia Malvenuto, Frederic Patras, Infinitesimal and B_infinity-algebras, finite spaces, and quasi-symmetric functions, Journal of Pure and Applied Algebra, Elsevier, 2016, 220 (6), pp. 2434-2458. .
  • F. Harary and E. M. Palmer, Graphical Enumeration, Academic Press, NY, 1973, p. 218 (but the last entry is wrong).
  • M. Kolli, On the cardinality of the T_0-topologies on a finite set, Preprint, 2014.
  • N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
  • N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
  • J. A. Wright, There are 718 6-point topologies, quasi-orderings and transgraphs, Notices Amer. Math. Soc., 17 (1970), p. 646, Abstract #70T-A106.
  • J. A. Wright, personal communication.
  • For further references concerning the enumeration of topologies and posets see under A000112 and A001035.

Crossrefs

Cf. A000798 (labeled topologies), A001035 (labeled posets), A001930 (unlabeled topologies), A000112 (unlabeled posets), A006057, A001928, A001929.
The case with unions only is A108798.
The case with intersections only is (also) A108798.
Partial sums are A326898 (the non-covering case).

Extensions

a(8)-a(12) from Goetz Pfeiffer (goetz.pfeiffer(AT)nuigalway.ie), Jan 21 2004
a(13)-a(16) from Brinkmann's and McKay's paper, sent by Vladeta Jovovic, Jan 04 2006

A001929 Number of connected topologies on n labeled points.

Original entry on oeis.org

1, 1, 3, 19, 233, 4851, 158175, 7724333, 550898367, 56536880923, 8267519506789, 1709320029453719, 496139872875425839, 200807248677750187825, 112602879608997769049739, 86955243134629606109442219, 91962123875462441868790125305, 132524871920295877733718959290203, 259048612476248175744581063815546423
Offset: 0

Views

Author

Keywords

References

  • K. K.-H. Butler and G. Markowsky, Enumeration of finite topologies, Proc. 4th S-E Conf. Combin., Graph Theory, Computing, Congress. Numer. 8 (1973), 169-184.
  • N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
  • N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Crossrefs

Sequences in the Erné (1974) paper: A000798, A001035, A006056, A006057, A001929, A001927, A006058, A006059, A000110.

Programs

  • Mathematica
    A001035 = {1, 1, 3, 19, 219, 4231, 130023, 6129859, 431723379, 44511042511, 6611065248783, 1396281677105899, 414864951055853499, 171850728381587059351, 98484324257128207032183, 77567171020440688353049939, 83480529785490157813844256579, 122152541250295322862941281269151, 241939392597201176602897820148085023};
    max = Length[A001035]-1;
    B[x_] = Sum[A001035[[k+1]]*x^k/k!, {k, 0, max}];
    A[x_] = 1 + Log[B[x]];
    A001927 = CoefficientList[ A[x] + O[x]^(max-1), x]*Range[0, max-2]!;
    a[n_] := Sum[StirlingS2[n, k] *A001927[[k+1]], {k, 0, n}];
    Table[a[n], {n, 0, max -2}] (* Jean-François Alcover, Aug 30 2018, after Vladeta Jovovic *)

Formula

a(n) = Sum_{k=0..n} Stirling2(n,k)*A001927(k). - Vladeta Jovovic, Apr 10 2006

Extensions

More terms from Vladeta Jovovic, Apr 10 2006
a(17)-a(18) using data from A001035 from Alois P. Heinz, Aug 30 2018

A074486 Encoding of topologies generated by classes of sets.

Original entry on oeis.org

1, 3, 9, 11, 15, 129, 131, 137, 139, 143, 153, 171, 175, 255
Offset: 0

Views

Author

Alford Arnold, Sep 26 2002

Keywords

Comments

We map {}, a, b, c, d, ... to 1, 2, 4, 16, 256, ..., i.e., to 2^0, 2^1, 2^2, 2^4, 2^8, ... . Sets with more than 1 element are mapped to the product. So ab (a shorthand notation for {a,b}) is mapped to 2^1 * 2^2 = 2^3. The topology is represented by the sum of the representations of its components.
The sequence encodes unlabeled topologies as described in A000798.

Examples

			1+2+8 = 11 (binary 1011) encodes {}, a, ab, which is the least encoding of this topology, so 11 is in the sequence.
1+4+8 = 13 (binary 1101) encodes {}, b, ab which is topologically equivalent and larger, so it is not in the sequence. The number of equivalent cases corresponding to a(n) begins 1; 1,1,2; 1,1,3,3,6,3,3,3,6; ... and is counted by A001928 (labeled topologies).
171 (binary 1011011) is in the sequence because we map {}, a, ab, ac, abc to 1 + 2 + 8 + 32 + 128.
		

Crossrefs

Extensions

Edited by Franklin T. Adams-Watters, Mar 29 2014
Showing 1-3 of 3 results.