Sequences
392,541 sequences
- T(n,k) = number of partitions of binomial(n,k), 0<=k<=n, triangular array read by rows.A090011
T(n,k) = number of partitions of binomial(n,k), 0<=k<=n, triangular array read by rows.
- Permanent of (0,1)-matrix of size n X (n+d) with d=2 and n-1 zeros not on a line.A090012
Permanent of (0,1)-matrix of size n X (n+d) with d=2 and n-1 zeros not on a line.
- Permanent of (0,1)-matrix of size n X (n+d) with d=3 and n-1 zeros not on a line.A090013
Permanent of (0,1)-matrix of size n X (n+d) with d=3 and n-1 zeros not on a line.
- Permanent of (0,1)-matrix of size n X (n+d) with d=4 and n-1 zeros not on a line.A090014
Permanent of (0,1)-matrix of size n X (n+d) with d=4 and n-1 zeros not on a line.
- Permanent of (0,1)-matrix of size n X (n+d) with d=5 and n-1 zeros not on a line.A090015
Permanent of (0,1)-matrix of size n X (n+d) with d=5 and n-1 zeros not on a line.
- Permanent of (0,1)-matrix of size n X (n+d) with d=6 and n-1 zeros not on a line.A090016
Permanent of (0,1)-matrix of size n X (n+d) with d=6 and n-1 zeros not on a line.
- a(n) = 4*a(n-1) + 2*a(n-2) for n>1, a(0)=0, a(1)=1.A090017
a(n) = 4*a(n-1) + 2*a(n-2) for n>1, a(0)=0, a(1)=1.
- a(n) = 6*a(n-1) + 3*a(n-2) for n > 2, a(0)=1, a(1)=6.A090018
a(n) = 6*a(n-1) + 3*a(n-2) for n > 2, a(0)=1, a(1)=6.
- a(n) = (3*10^n + 2*0^n)/5.A090019
a(n) = (3*10^n + 2*0^n)/5.
- Number of distinct lines through the origin in the n-dimensional lattice of side length 4.A090020
Number of distinct lines through the origin in the n-dimensional lattice of side length 4.
- Number of distinct lines through the origin in the n-dimensional lattice of side length 5.A090021
Number of distinct lines through the origin in the n-dimensional lattice of side length 5.
- Number of distinct lines through the origin in the n-dimensional lattice of side length 6.A090022
Number of distinct lines through the origin in the n-dimensional lattice of side length 6.
- Number of distinct lines through the origin in the n-dimensional lattice of side length 7.A090023
Number of distinct lines through the origin in the n-dimensional lattice of side length 7.
- Number of distinct lines through the origin in the n-dimensional lattice of side length 8.A090024
Number of distinct lines through the origin in the n-dimensional lattice of side length 8.
- Number of distinct lines through the origin in 3-dimensional cube of side length n.A090025
Number of distinct lines through the origin in 3-dimensional cube of side length n.
- Number of distinct lines through the origin in 4-dimensional cube of side length n.A090026
Number of distinct lines through the origin in 4-dimensional cube of side length n.
- Number of distinct lines through the origin in 5-dimensional cube of side length n.A090027
Number of distinct lines through the origin in 5-dimensional cube of side length n.
- Number of distinct lines through the origin in 6-dimensional cube of side length n.A090028
Number of distinct lines through the origin in 6-dimensional cube of side length n.
- Number of distinct lines through the origin in 7-dimensional cube of side length n.A090029
Number of distinct lines through the origin in 7-dimensional cube of side length n.
- Triangle read by rows: T(n,k) = number of distinct lines through the origin in the n-dimensional cubic lattice of side length k with one corner at the origin.A090030
Triangle read by rows: T(n,k) = number of distinct lines through the origin in the n-dimensional cubic lattice of side length k with one corner at the origin.
- Number of configurations of the 5 X 5 variant of sliding block 15-puzzle ("24-puzzle") that require a minimum of n moves to be reached, starting with the empty square in one of the corners.A090031
Number of configurations of the 5 X 5 variant of sliding block 15-puzzle ("24-puzzle") that require a minimum of n moves to be reached, starting with the empty square in one of the corners.
- Number of configurations of the 6 X 6 variant of Sam Loyd's sliding block 15-puzzle ("35-puzzle") that require a minimum of n moves to be reached, starting with the empty square in one of the corners.A090032
Number of configurations of the 6 X 6 variant of Sam Loyd's sliding block 15-puzzle ("35-puzzle") that require a minimum of n moves to be reached, starting with the empty square in one of the corners.
- Triangle T(j,k) read by rows, where T(j,k) is the number of single tile moves in the longest optimal solution of the j X k generalization of the sliding block 15-puzzle, starting with the empty square in a corner.A090033
Triangle T(j,k) read by rows, where T(j,k) is the number of single tile moves in the longest optimal solution of the j X k generalization of the sliding block 15-puzzle, starting with the empty square in a corner.
- Number of configurations of the 3 X 2 variant of Sam Loyd's sliding block 15-puzzle that require a minimum of n moves to be reached, starting with the empty square in one of the corners.A090034
Number of configurations of the 3 X 2 variant of Sam Loyd's sliding block 15-puzzle that require a minimum of n moves to be reached, starting with the empty square in one of the corners.
- Number of configurations of the 4 X 2 variant of Sam Loyd's sliding block 15-puzzle that require a minimum of n moves to be reached, starting with the empty square in one of the corners.A090035
Number of configurations of the 4 X 2 variant of Sam Loyd's sliding block 15-puzzle that require a minimum of n moves to be reached, starting with the empty square in one of the corners.
- Number of configurations of the 5 X 2 variant of Sam Loyd's sliding block 15-puzzle that require a minimum of n moves to be reached, starting with the empty square in one of the corners.A090036
Number of configurations of the 5 X 2 variant of Sam Loyd's sliding block 15-puzzle that require a minimum of n moves to be reached, starting with the empty square in one of the corners.
- Number of tetramagic (4-multimagic) series for squares of order n.A090037
Number of tetramagic (4-multimagic) series for squares of order n.
- a(n) = floor(1/({n*k}-{n*k}^2)) -1, where k = sqrt(2)-1 and {} is the fractional part.A090038
a(n) = floor(1/({n*k}-{n*k}^2)) -1, where k = sqrt(2)-1 and {} is the fractional part.
- a(1) = 1, otherwise a(n) = floor(e^(n+1)/(e^2 + 1)).A090039
a(1) = 1, otherwise a(n) = floor(e^(n+1)/(e^2 + 1)).
- (3*6^n + 2^n)/4.A090040
(3*6^n + 2^n)/4.
- a(n) = 10*a(n-1) - 20*a(n-2), a(0)=1, a(1)=6.A090041
a(n) = 10*a(n-1) - 20*a(n-2), a(0)=1, a(1)=6.
- a(n) = 2*a(n-1) + 11*a(n-2) for n > 1, a(0) = a(1) = 1.A090042
a(n) = 2*a(n-1) + 11*a(n-2) for n > 1, a(0) = a(1) = 1.
- Numbers n such that there exists a block-transitive point-imprimitive 3-design with parameters (k(k-1)/2+1, k, lambda) for some lambda.A090043
Numbers n such that there exists a block-transitive point-imprimitive 3-design with parameters (k(k-1)/2+1, k, lambda) for some lambda.
- Triangle read by rows: T(n,k) = A083093 with 1's and 2's interchanged.A090044
Triangle read by rows: T(n,k) = A083093 with 1's and 2's interchanged.
- Number of equivalence classes of reflexive polytopes in dimension n.A090045
Number of equivalence classes of reflexive polytopes in dimension n.
- Length of longest contiguous block of 0's in binary expansion of n-th prime.A090046
Length of longest contiguous block of 0's in binary expansion of n-th prime.
- Length of longest contiguous block of 0's in binary expansion of n^2.A090047
Length of longest contiguous block of 0's in binary expansion of n^2.
- Length of longest contiguous block of 0's in binary expansion of n-th triangular number.A090048
Length of longest contiguous block of 0's in binary expansion of n-th triangular number.
- Length of longest contiguous block of 0's in binary expansion of n^3.A090049
Length of longest contiguous block of 0's in binary expansion of n^3.
- Numbers having equal length of longest contiguous block of zeros and ones in binary expansion.A090050
Numbers having equal length of longest contiguous block of zeros and ones in binary expansion.
- Number of chess diagrams that can be obtained in exactly one way in n plies. This is also the number of dual-free proof games in n plies.A090051
Number of chess diagrams that can be obtained in exactly one way in n plies. This is also the number of dual-free proof games in n plies.
- Group-abundant numbers: n such that the number of groups of order n (A000001) exceeds n.A090052
Group-abundant numbers: n such that the number of groups of order n (A000001) exceeds n.
- Numbers divisible by the number formed when their digits are sorted in ascending order, excluding trivial cases.A090053
Numbers divisible by the number formed when their digits are sorted in ascending order, excluding trivial cases.
- Numbers n which divide the number formed when their digits are sorted in descending order excluding trivial cases.A090054
Numbers n which divide the number formed when their digits are sorted in descending order excluding trivial cases.
- Numbers n divisible by at least one nontrivial permutation (rearrangement) of the digits of n.A090055
Numbers n divisible by at least one nontrivial permutation (rearrangement) of the digits of n.
- Numbers k divisible by at least one nontrivial permutation (rearrangement) of the digits of k, excluding all permutations that result in digit loss.A090056
Numbers k divisible by at least one nontrivial permutation (rearrangement) of the digits of k, excluding all permutations that result in digit loss.
- Numbers n divisible by exactly two nontrivial permutations (rearrangements) of the digits of n.A090057
Numbers n divisible by exactly two nontrivial permutations (rearrangements) of the digits of n.
- Numbers n divisible by exactly three nontrivial permutations (rearrangements) of the digits of n.A090058
Numbers n divisible by exactly three nontrivial permutations (rearrangements) of the digits of n.
- Numbers n divisible by exactly four nontrivial permutations (rearrangements) of the digits of n.A090059
Numbers n divisible by exactly four nontrivial permutations (rearrangements) of the digits of n.
- Numbers n divisible by exactly five nontrivial permutations (rearrangements) of the digits of n.A090060
Numbers n divisible by exactly five nontrivial permutations (rearrangements) of the digits of n.