Sequences
392,541 sequences
- Triangle T(n,k) giving the number of loopless matroids of rank k on n labeled points (n >= 1, 1 <= k <= n).A058711
Triangle T(n,k) giving the number of loopless matroids of rank k on n labeled points (n >= 1, 1 <= k <= n).
- Number of loopless matroids on n labeled points.A058712
Number of loopless matroids on n labeled points.
- McKay-Thompson series of class 55A for the Monster group.A058713
McKay-Thompson series of class 55A for the Monster group.
- McKay-Thompson series of class 56A for the Monster group.A058714
McKay-Thompson series of class 56A for the Monster group.
- Number of loopless matroids of rank 3 on n labeled points.A058715
Number of loopless matroids of rank 3 on n labeled points.
- Triangle T(n,k) giving number of nonisomorphic loopless matroids of rank k on n labeled points (n >= 0, 0 <= k <= n).A058716
Triangle T(n,k) giving number of nonisomorphic loopless matroids of rank k on n labeled points (n >= 0, 0 <= k <= n).
- Triangle T(n,k) giving number of nonisomorphic loopless matroids of rank k on n labeled points (n >= 1, 1<=k<=n).A058717
Triangle T(n,k) giving number of nonisomorphic loopless matroids of rank k on n labeled points (n >= 1, 1<=k<=n).
- Number of nonisomorphic loopless matroids on n unlabeled points.A058718
Number of nonisomorphic loopless matroids on n unlabeled points.
- Number of nonisomorphic loopless matroids of rank 3 on n labeled points.A058719
Number of nonisomorphic loopless matroids of rank 3 on n labeled points.
- Triangle T(n,k) giving the number of simple matroids of rank k on n labeled points (n >= 2, 2 <= k <= n).A058720
Triangle T(n,k) giving the number of simple matroids of rank k on n labeled points (n >= 2, 2 <= k <= n).
- Number of simple matroids on n labeled points.A058721
Number of simple matroids on n labeled points.
- Number of simple matroids of rank 4 on n labeled points.A058722
Number of simple matroids of rank 4 on n labeled points.
- McKay-Thompson series of class 58a for the Monster group.A058723
McKay-Thompson series of class 58a for the Monster group.
- McKay-Thompson series of class 59A for the Monster group.A058724
McKay-Thompson series of class 59A for the Monster group.
- McKay-Thompson series of class 60A for the Monster group.A058725
McKay-Thompson series of class 60A for the Monster group.
- McKay-Thompson series of class 60B for Monster.A058726
McKay-Thompson series of class 60B for Monster.
- McKay-Thompson series of class 60C for Monster.A058727
McKay-Thompson series of class 60C for Monster.
- McKay-Thompson series of class 60D for the Monster group.A058728
McKay-Thompson series of class 60D for the Monster group.
- McKay-Thompson series of class 60E for the Monster group.A058729
McKay-Thompson series of class 60E for the Monster group.
- Triangle T(n,k) giving number of nonisomorphic simple matroids of rank k on n labeled points (n >= 2, 2 <= k <= n).A058730
Triangle T(n,k) giving number of nonisomorphic simple matroids of rank k on n labeled points (n >= 2, 2 <= k <= n).
- Number of nonisomorphic simple matroids of rank 3 on n unlabeled points.A058731
Number of nonisomorphic simple matroids of rank 3 on n unlabeled points.
- McKay-Thompson series of class 60b for Monster.A058732
McKay-Thompson series of class 60b for Monster.
- Number of nonisomorphic simple matroids of rank 4 on n labeled points.A058733
Number of nonisomorphic simple matroids of rank 4 on n labeled points.
- Nim-product n*(n+1).A058734
Nim-product n*(n+1).
- Triangle of coefficients in expansion of enumerators for series-reduced rooted trees by lines at the root.A058735
Triangle of coefficients in expansion of enumerators for series-reduced rooted trees by lines at the root.
- McKay-Thompson series of class 62A for Monster.A058736
McKay-Thompson series of class 62A for Monster.
- Main diagonal of A058735.A058737
Main diagonal of A058735.
- a(n) = floor(n*exp(n)).A058738
a(n) = floor(n*exp(n)).
- McKay-Thompson series of class 66A for Monster.A058739
McKay-Thompson series of class 66A for Monster.
- McKay-Thompson series of class 66B for Monster.A058740
McKay-Thompson series of class 66B for Monster.
- McKay-Thompson series of class 66a for Monster.A058741
McKay-Thompson series of class 66a for Monster.
- McKay-Thompson series of class 68A for Monster.A058742
McKay-Thompson series of class 68A for Monster.
- McKay-Thompson series of class 69A for Monster.A058743
McKay-Thompson series of class 69A for Monster.
- McKay-Thompson series of class 70A for Monster.A058744
McKay-Thompson series of class 70A for Monster.
- McKay-Thompson series of class 70B for Monster.A058745
McKay-Thompson series of class 70B for Monster.
- McKay-Thompson series of class 70a for Monster.A058746
McKay-Thompson series of class 70a for Monster.
- Duplicate of A034322.A058747
Duplicate of A034322.
- a(n) = round(n*exp(n)).A058748
a(n) = round(n*exp(n)).
- a(n) = ceiling(n*exp(n)).A058749
a(n) = ceiling(n*exp(n)).
- a(n) = floor(log(n)*exp(n)).A058750
a(n) = floor(log(n)*exp(n)).
- a(n) = ceiling(log(n)*exp(n)).A058751
a(n) = ceiling(log(n)*exp(n)).
- a(n) = round(log(n)*exp(n)).A058752
a(n) = round(log(n)*exp(n)).
- McKay-Thompson series of class 76a for Monster.A058753
McKay-Thompson series of class 76a for Monster.
- McKay-Thompson series of class 78A for Monster.A058754
McKay-Thompson series of class 78A for Monster.
- McKay-Thompson series of class 78B for Monster.A058755
McKay-Thompson series of class 78B for Monster.
- G.f. is (1-S)/(1+S), where S = g.f. for A000084.A058756
G.f. is (1-S)/(1+S), where S = g.f. for A000084.
- a(n) = n*coefficient of x^n in log(1+S), S = g.f. for A000084.A058757
a(n) = n*coefficient of x^n in log(1+S), S = g.f. for A000084.
- McKay-Thompson series of class 84A for Monster.A058758
McKay-Thompson series of class 84A for Monster.
- Shannon switching function: a(n) is the least number k such that any switching (or Boolean) function of n variables can be realized as a two-terminal network of AND's and OR's in which the total number of occurrences of the variables X_1, X_1', ..., X_n, X_n' is no more than k (where the primes indicate complements).A058759
Shannon switching function: a(n) is the least number k such that any switching (or Boolean) function of n variables can be realized as a two-terminal network of AND's and OR's in which the total number of occurrences of the variables X_1, X_1', ..., X_n, X_n' is no more than k (where the primes indicate complements).
- Integers whose set of prime factors (taken with multiplicity) uses each digit exactly once (i.e., is pandigital) in some base b > 1. Numbers are expressed in base 10.A058760
Integers whose set of prime factors (taken with multiplicity) uses each digit exactly once (i.e., is pandigital) in some base b > 1. Numbers are expressed in base 10.