Sequences
392,541 sequences
- Number of points in square lattice covered by a disc centered at (0,0) as its radius increases.A057961
Number of points in square lattice covered by a disc centered at (0,0) as its radius increases.
- Number of points (x,y) in square lattice with (x-1/2)^2+(y-1/2)^2 <= n.A057962
Number of points (x,y) in square lattice with (x-1/2)^2+(y-1/2)^2 <= n.
- Triangle T(n,k) of number of minimal 2-covers of a labeled n-set that cover k points of that set uniquely (k=2,..,n).A057963
Triangle T(n,k) of number of minimal 2-covers of a labeled n-set that cover k points of that set uniquely (k=2,..,n).
- Triangle T(n,k) of number of minimal 3-covers of a labeled n-set that cover k points of that set uniquely (k=3,..,n).A057964
Triangle T(n,k) of number of minimal 3-covers of a labeled n-set that cover k points of that set uniquely (k=3,..,n).
- Triangle T(n,k) of number of minimal 4-covers of a labeled n-set that cover k points of that set uniquely (k=4,..,n).A057965
Triangle T(n,k) of number of minimal 4-covers of a labeled n-set that cover k points of that set uniquely (k=4,..,n).
- Triangle T(n,k) of number of minimal 5-covers of a labeled n-set that cover k points of that set uniquely (k=5,..,n).A057966
Triangle T(n,k) of number of minimal 5-covers of a labeled n-set that cover k points of that set uniquely (k=5,..,n).
- Triangle T(n,k) of numbers of minimal 4-covers of an unlabeled n+4-set that cover k points of that set uniquely (k=4,..,n+4).A057967
Triangle T(n,k) of numbers of minimal 4-covers of an unlabeled n+4-set that cover k points of that set uniquely (k=4,..,n+4).
- Triangle T(n,k) of numbers of minimal 5-covers of an unlabeled n+5-set that cover k points of that set uniquely (k=5,..,n+5).A057968
Triangle T(n,k) of numbers of minimal 5-covers of an unlabeled n+5-set that cover k points of that set uniquely (k=5,..,n+5).
- 5 x n binary matrices without unit columns up to row and column permutations.A057969
5 x n binary matrices without unit columns up to row and column permutations.
- 5 x n binary matrices with 1 unit column up to row and column permutations.A057970
5 x n binary matrices with 1 unit column up to row and column permutations.
- Number of 5 x n binary matrices with 2 unit columns up to row and column permutations.A057971
Number of 5 x n binary matrices with 2 unit columns up to row and column permutations.
- Number of 5 X n binary matrices with 3 unit columns up to row and column permutations.A057972
Number of 5 X n binary matrices with 3 unit columns up to row and column permutations.
- Number of polybricks: number of ways to arrange n 1 X 2 "bricks" in a wall (see illustrations).A057973
Number of polybricks: number of ways to arrange n 1 X 2 "bricks" in a wall (see illustrations).
- Deepest position in the deck reached by card 1 before returning to the top in the shuffle in A035485 and A035499.A057974
Deepest position in the deck reached by card 1 before returning to the top in the shuffle in A035485 and A035499.
- Record depths reached by card 1 in the shuffle in A035485.A057975
Record depths reached by card 1 in the shuffle in A035485.
- Number of shuffles where card 1 reaches a record depth (A057975) under the shuffle in A035485.A057976
Number of shuffles where card 1 reaches a record depth (A057975) under the shuffle in A035485.
- GCD of consecutive central binomial coefficients: a(n) = gcd(A001405(n+1), A001405(n)).A057977
GCD of consecutive central binomial coefficients: a(n) = gcd(A001405(n+1), A001405(n)).
- Number of untouchable numbers <= 10^n.A057978
Number of untouchable numbers <= 10^n.
- a(n) = 1 for even n and (n-1)/2 for odd n.A057979
a(n) = 1 for even n and (n-1)/2 for odd n.
- Let n be a positive integer, n>3. Define a tournament on the vertex set {2,3,..,n} by: for i < j, i is adjacent to j if i divides j, else j is adjacent to i. If T(n) denotes its adjacency matrix, then the above sequence is det(T(n))for n=4,5,6....42.A057980
Let n be a positive integer, n>3. Define a tournament on the vertex set {2,3,..,n} by: for i < j, i is adjacent to j if i divides j, else j is adjacent to i. If T(n) denotes its adjacency matrix, then the above sequence is det(T(n))for n=4,5,6....42.
- Number of singular n X n (-1,0,1)-matrices.A057981
Number of singular n X n (-1,0,1)-matrices.
- Number of singular n X n (-1,1)-matrices.A057982
Number of singular n X n (-1,1)-matrices.
- These numbers take a record number of steps to reach the top of the deck in Guy's shuffle (see A035485).A057983
These numbers take a record number of steps to reach the top of the deck in Guy's shuffle (see A035485).
- These numbers are the record number of steps for the numbers in A057983 to reach the top of the deck in Guy's shuffle (see A035485).A057984
These numbers are the record number of steps for the numbers in A057983 to reach the top of the deck in Guy's shuffle (see A035485).
- Start with 0 and repeatedly substitute: 0->01, 1->12, 2->0.A057985
Start with 0 and repeatedly substitute: 0->01, 1->12, 2->0.
- Positions of 0 in A057985.A057986
Positions of 0 in A057985.
- Positions of 1 in A057985.A057987
Positions of 1 in A057985.
- Positions of 2 in A057985.A057988
Positions of 2 in A057985.
- Positions of 00 or 11 or 22 in A057985.A057989
Positions of 00 or 11 or 22 in A057985.
- Positions of 00 in A057985.A057990
Positions of 00 in A057985.
- Number of quasigroups of order n.A057991
Number of quasigroups of order n.
- Number of commutative quasigroups of order n.A057992
Number of commutative quasigroups of order n.
- Number of self-converse quasigroups of order n.A057993
Number of self-converse quasigroups of order n.
- Number of asymmetric quasigroups of order n.A057994
Number of asymmetric quasigroups of order n.
- Coefficient triangle of polynomials (rising powers) related to Fibonacci convolutions. Companion triangle to A057280.A057995
Coefficient triangle of polynomials (rising powers) related to Fibonacci convolutions. Companion triangle to A057280.
- Number of self-converse loops (quasigroups with an identity element) of order n.A057996
Number of self-converse loops (quasigroups with an identity element) of order n.
- Number of labeled loops (quasigroups with an identity element).A057997
Number of labeled loops (quasigroups with an identity element).
- Number of asymmetric loops (quasigroups with an identity element).A057998
Number of asymmetric loops (quasigroups with an identity element).
- a(n) is smallest prime such that a(n)-1 is a proper multiple of a(n-1)-1, with a(0) = 2.A057999
a(n) is smallest prime such that a(n)-1 is a proper multiple of a(n-1)-1, with a(0) = 2.
- a(n) is smallest prime such that a(n)+1 is a proper multiple of a(n-1)+1 [with a(1)=1].A058000
a(n) is smallest prime such that a(n)+1 is a proper multiple of a(n-1)+1 [with a(1)=1].
- Number of 3 X 3 matrices with entries mod n, up to row and column permutation.A058001
Number of 3 X 3 matrices with entries mod n, up to row and column permutation.
- Number of 4 X 4 matrices with entries mod n, up to row and column permutation.A058002
Number of 4 X 4 matrices with entries mod n, up to row and column permutation.
- Number of 5 X 5 matrices with entries mod n, up to row and column permutation.A058003
Number of 5 X 5 matrices with entries mod n, up to row and column permutation.
- Number of 6 X 6 matrices with entries mod n, up to row and column permutation.A058004
Number of 6 X 6 matrices with entries mod n, up to row and column permutation.
- a(n) = gcd(2*n, binomial(2*n, n)).A058005
a(n) = gcd(2*n, binomial(2*n, n)).
- Alternating factorials: 0! - 1! + 2! - ... + (-1)^n n!A058006
Alternating factorials: 0! - 1! + 2! - ... + (-1)^n n!
- Freestyle perfect numbers n = Product_{i=1,..,k} f_i^e_i where 1 < f_1 < ... < f_k, e_i > 0, such that 2n = Product_{i=1,..,k} (f_i^(e_i+1)-1)/(f_i-1).A058007
Freestyle perfect numbers n = Product_{i=1,..,k} f_i^e_i where 1 < f_1 < ... < f_k, e_i > 0, such that 2n = Product_{i=1,..,k} (f_i^(e_i+1)-1)/(f_i-1).
- Numbers k such that (2*k - 1)!/(k!)^2 is an integer.A058008
Numbers k such that (2*k - 1)!/(k!)^2 is an integer.
- a(n) is obtained by applying the map k -> prime(k) n times, starting at n.A058009
a(n) is obtained by applying the map k -> prime(k) n times, starting at n.
- The main diagonal of N. Fernandez's Order of Primeness array.A058010
The main diagonal of N. Fernandez's Order of Primeness array.