Sequences
392,541 sequences
- Triangulations of the disk G_{n,1}.A002710
Triangulations of the disk G_{n,1}.
- Triangulations of the disk G_{n,2}.A002711
Triangulations of the disk G_{n,2}.
- Number of unrooted triangulations of a disk that have reflection symmetry with n interior nodes and 3 nodes on the boundary.A002712
Number of unrooted triangulations of a disk that have reflection symmetry with n interior nodes and 3 nodes on the boundary.
- Number of unrooted triangulations of the disk with n interior nodes and 3 nodes on the boundary.A002713
Number of unrooted triangulations of the disk with n interior nodes and 3 nodes on the boundary.
- Number of different keys with n cuts, depths between 1 and 7 and depth difference at most 1 between adjacent cut depths.A002714
Number of different keys with n cuts, depths between 1 and 7 and depth difference at most 1 between adjacent cut depths.
- An infinite coprime sequence defined by recursion.A002715
An infinite coprime sequence defined by recursion.
- An infinite coprime sequence defined by recursion.A002716
An infinite coprime sequence defined by recursion.
- a(n) = floor(n(n+2)(2n+1)/8).A002717
a(n) = floor(n(n+2)(2n+1)/8).
- Number of bicoverings of an n-set.A002718
Number of bicoverings of an n-set.
- Erroneous version of A020554.A002719
Erroneous version of A020554.
- Number of partial permutations of an n-set; number of n X n binary matrices with at most one 1 in each row and column.A002720
Number of partial permutations of an n-set; number of n X n binary matrices with at most one 1 in each row and column.
- Number of 3 X 3 X 3 arrays M_ijk (1 <= i,j,k <= 3) with entries satisfying 0 <= M_ijk <= n and all line sums equal to n.A002721
Number of 3 X 3 X 3 arrays M_ijk (1 <= i,j,k <= 3) with entries satisfying 0 <= M_ijk <= n and all line sums equal to n.
- Rotatable partitions.A002722
Rotatable partitions.
- Number of rotatable partitions of [n].A002723
Number of rotatable partitions of [n].
- Number of inequivalent n X n binary matrices, where equivalence means permutations of rows or columns.A002724
Number of inequivalent n X n binary matrices, where equivalence means permutations of rows or columns.
- Number of incidence matrices: n X (n+1) binary matrices under row and column permutations.A002725
Number of incidence matrices: n X (n+1) binary matrices under row and column permutations.
- a(n) = Fibonacci(n+1) mod n.A002726
a(n) = Fibonacci(n+1) mod n.
- Number of 3 X n binary matrices up to row and column permutations.A002727
Number of 3 X n binary matrices up to row and column permutations.
- Number of n X (n+2) binary matrices.A002728
Number of n X (n+2) binary matrices.
- Number of equivalence classes of binary sequences of period n.A002729
Number of equivalence classes of binary sequences of period n.
- Number of equivalence classes of binary sequences of primitive period n.A002730
Number of equivalence classes of binary sequences of primitive period n.
- Numbers k such that (k^2 + 1)/2 is prime.A002731
Numbers k such that (k^2 + 1)/2 is prime.
- Numbers k such that (4*k^2 + 1)/5 is prime.A002732
Numbers k such that (4*k^2 + 1)/5 is prime.
- Numbers k such that (k^2 + 1)/10 is prime.A002733
Numbers k such that (k^2 + 1)/10 is prime.
- Remove squares!A002734
Remove squares!
- Related to Euler numbers, expansion of e.g.f. sec(x)*tan^2(x).A002735
Related to Euler numbers, expansion of e.g.f. sec(x)*tan^2(x).
- Apéry numbers: a(n) = n^2*C(2n,n).A002736
Apéry numbers: a(n) = n^2*C(2n,n).
- a(n) = Sum_{j=0..n} (n+j)*binomial(n+j,j).A002737
a(n) = Sum_{j=0..n} (n+j)*binomial(n+j,j).
- Coefficients for extrapolation.A002738
Coefficients for extrapolation.
- a(n) = ((2*n-1)!/(2*n!*(n-2)!))*((n^3-3*n^2+2*n+2)/(n^2-1)).A002739
a(n) = ((2*n-1)!/(2*n!*(n-2)!))*((n^3-3*n^2+2*n+2)/(n^2-1)).
- Number of tree-rooted bridgeless planar maps with two vertices and n faces.A002740
Number of tree-rooted bridgeless planar maps with two vertices and n faces.
- Logarithmic numbers: expansion of the e.g.f. -log(1-x) * e^(-x).A002741
Logarithmic numbers: expansion of the e.g.f. -log(1-x) * e^(-x).
- Logarithmic numbers.A002742
Logarithmic numbers.
- Sum of logarithmic numbers.A002743
Sum of logarithmic numbers.
- Sum of logarithmic numbers.A002744
Sum of logarithmic numbers.
- Sum of logarithmic numbers.A002745
Sum of logarithmic numbers.
- Sum of logarithmic numbers.A002746
Sum of logarithmic numbers.
- Logarithmic numbers.A002747
Logarithmic numbers.
- Sum of logarithmic numbers.A002748
Sum of logarithmic numbers.
- Sum of logarithmic numbers.A002749
Sum of logarithmic numbers.
- Sum of logarithmic numbers.A002750
Sum of logarithmic numbers.
- Sum of logarithmic numbers.A002751
Sum of logarithmic numbers.
- a(n) = Fibonacci(n-1) mod n.A002752
a(n) = Fibonacci(n-1) mod n.
- Coefficients of elliptic function sn.A002753
Coefficients of elliptic function sn.
- Related to coefficient of m in Jacobi elliptic function cn(z, m).A002754
Related to coefficient of m in Jacobi elliptic function cn(z, m).
- Number of bipartite partitions of n white objects and 6 black ones.A002755
Number of bipartite partitions of n white objects and 6 black ones.
- Number of bipartite partitions of n white objects and 7 black ones.A002756
Number of bipartite partitions of n white objects and 7 black ones.
- Number of bipartite partitions of n white objects and 8 black ones.A002757
Number of bipartite partitions of n white objects and 8 black ones.
- Number of bipartite partitions of n white objects and 9 black ones.A002758
Number of bipartite partitions of n white objects and 9 black ones.
- Number of bipartite partitions of n white objects and 10 black ones.A002759
Number of bipartite partitions of n white objects and 10 black ones.