Sequences
392,541 sequences
- Dimensions of graded algebra associated with meanders.A060111
Dimensions of graded algebra associated with meanders.
- Sums of nonconsecutive factorial numbers.A060112
Sums of nonconsecutive factorial numbers.
- Least common multiple of all orbit lengths of the permutation A038776.A060113
Least common multiple of all orbit lengths of the permutation A038776.
- Least common multiple of all cycle sizes in range [A014137(n-1)..A014138(n-1)] of permutation A057505/A057506.A060114
Least common multiple of all cycle sizes in range [A014137(n-1)..A014138(n-1)] of permutation A057505/A057506.
- First quotients of A060113.A060115
First quotients of A060113.
- First quotients of A060114.A060116
First quotients of A060114.
- A list of all finite permutations in "PermUnrank3R" ordering. (Inverses of the permutations of A060118.)A060117
A list of all finite permutations in "PermUnrank3R" ordering. (Inverses of the permutations of A060118.)
- A list of all finite permutations in "PermUnrank3L" ordering. (Inverses of the permutations of A060117.)A060118
A list of all finite permutations in "PermUnrank3L" ordering. (Inverses of the permutations of A060117.)
- Positions of permutations of A060117 in reversed colexicographic ordering A055089.A060119
Positions of permutations of A060117 in reversed colexicographic ordering A055089.
- Positions of permutations of A060118 in the canonical permutation list A055089.A060120
Positions of permutations of A060118 in the canonical permutation list A055089.
- First solution mod p of x^3 = 2 for primes p such that only one solution exists.A060121
First solution mod p of x^3 = 2 for primes p such that only one solution exists.
- Smallest solution mod p of x^3 = 2 for primes p such that more than one solution exists.A060122
Smallest solution mod p of x^3 = 2 for primes p such that more than one solution exists.
- Second solution mod p of x^3 = 2 for primes p such that more than one solution exists.A060123
Second solution mod p of x^3 = 2 for primes p such that more than one solution exists.
- Third solution mod p of x^3 = 2 for primes p such that more than one solution exists.A060124
Third solution mod p of x^3 = 2 for primes p such that more than one solution exists.
- Self-inverse infinite permutation which shows the position of the inverse of each finite permutation in A060117 (or A060118) in the same sequence; or equally, the cross-indexing between A060117 and A060118.A060125
Self-inverse infinite permutation which shows the position of the inverse of each finite permutation in A060117 (or A060118) in the same sequence; or equally, the cross-indexing between A060117 and A060118.
- Positions of permutations of A055089 in the permutation sequence A060117.A060126
Positions of permutations of A055089 in the permutation sequence A060117.
- Positions of permutations of A055089 in the permutation sequence A060118. Inverse permutation to A060120.A060127
Positions of permutations of A055089 in the permutation sequence A060118. Inverse permutation to A060120.
- a(n) is the number of disjoint cycles (excluding 1-cycles, i.e., fixed elements) in the n-th permutation of A060117 and A060118.A060128
a(n) is the number of disjoint cycles (excluding 1-cycles, i.e., fixed elements) in the n-th permutation of A060117 and A060118.
- Number of moved (non-fixed) elements in the permutation with rank number n in lists A060117 (or in A060118), i.e., the sum of the lengths of all cycles larger than one in that permutation.A060129
Number of moved (non-fixed) elements in the permutation with rank number n in lists A060117 (or in A060118), i.e., the sum of the lengths of all cycles larger than one in that permutation.
- Number of nonzero digits in factorial base representation (A007623) of n; minimum number of transpositions needed to compose each permutation in the lists A060117 & A060118.A060130
Number of nonzero digits in factorial base representation (A007623) of n; minimum number of transpositions needed to compose each permutation in the lists A060117 & A060118.
- a(n) = A072411(A275725(n)); order of each permutation listed in tables A060117 and A060118, i.e., the least common multiple of the cycle sizes.A060131
a(n) = A072411(A275725(n)); order of each permutation listed in tables A060117 and A060118, i.e., the least common multiple of the cycle sizes.
- Positions of the permutations which have the same rank in A055089 and A060117, i.e., the fixed points of permutations A060119 and A060126.A060132
Positions of the permutations which have the same rank in A055089 and A060117, i.e., the fixed points of permutations A060119 and A060126.
- Positions of the permutations which have the same rank in A055089 and A060118, i.e., the fixed points of permutations A060120 and A060127.A060133
Positions of the permutations which have the same rank in A055089 and A060118, i.e., the fixed points of permutations A060120 and A060127.
- Positions of permutations produced by the transposition sequence A060135 in A055089.A060134
Positions of permutations produced by the transposition sequence A060135 in A055089.
- Sequence of adjacent transpositions (a[n] a[n]+1), which, when starting from the identity permutation and applied successively, produce a Hamiltonian circuit through all permutations of S_4, in such a way that S_{n-1} is always traversed before the rest of S_n. Furthermore, each subsequence from the first to the (n!-1)-th term is palindromic.A060135
Sequence of adjacent transpositions (a[n] a[n]+1), which, when starting from the identity permutation and applied successively, produce a Hamiltonian circuit through all permutations of S_4, in such a way that S_{n-1} is always traversed before the rest of S_n. Furthermore, each subsequence from the first to the (n!-1)-th term is palindromic.
- Square array read by antidiagonals with T(n,k)=T(n,k-1)^2+n*T(n,k-1)+1 and T(n,0)=0.A060136
Square array read by antidiagonals with T(n,k)=T(n,k-1)^2+n*T(n,k-1)+1 and T(n,0)=0.
- Square array read by antidiagonals with T(n,k)=T(n,k-1)^2-n*T(n,k-1)+1 and T(n,0)=0.A060137
Square array read by antidiagonals with T(n,k)=T(n,k-1)^2-n*T(n,k-1)+1 and T(n,0)=0.
- Ordered set S defined by these rules: 0 and 2 are in S and if x is a nonzero number in S, then 2x-1 and 4x are in S.A060138
Ordered set S defined by these rules: 0 and 2 are in S and if x is a nonzero number in S, then 2x-1 and 4x are in S.
- Ordered set S defined by these rules: 0 and 1 are in S and if x is a nonzero number in S, then 3x-1 and 9x are in S.A060139
Ordered set S defined by these rules: 0 and 1 are in S and if x is a nonzero number in S, then 3x-1 and 9x are in S.
- Ordered set S defined by these rules: 0 and 1 are in S and if x is a nonzero number in S, then 3x and 9x+1 are in S.A060140
Ordered set S defined by these rules: 0 and 1 are in S and if x is a nonzero number in S, then 3x and 9x+1 are in S.
- Ordered set S defined by these rules: 0 and 1 are in S and if x is a nonzero number in S, then 3x and 9x+2 are in S.A060141
Ordered set S defined by these rules: 0 and 1 are in S and if x is a nonzero number in S, then 3x and 9x+2 are in S.
- Ordered set S defined by these rules: 0 is in S and if x is in S then 2x+1 and 4x are in S.A060142
Ordered set S defined by these rules: 0 is in S and if x is in S then 2x+1 and 4x are in S.
- a(n) = floor(n/tau), where tau = (1 + sqrt(5))/2.A060143
a(n) = floor(n/tau), where tau = (1 + sqrt(5))/2.
- a(n) = floor(n/(1+phi)), or equivalently floor(n/phi^2), where phi is the golden ratio (A001622).A060144
a(n) = floor(n/(1+phi)), or equivalently floor(n/phi^2), where phi is the golden ratio (A001622).
- a(n) = floor(n/tau) - floor(n/(1 + tau)).A060145
a(n) = floor(n/tau) - floor(n/(1 + tau)).
- Take the first 2n integers and using each integer once and only once as either a numerator or a denominator, construct n fractions whose sum is an integer; a(n) = number of distinct solutions for n.A060146
Take the first 2n integers and using each integer once and only once as either a numerator or a denominator, construct n fractions whose sum is an integer; a(n) = number of distinct solutions for n.
- Nim-binomial transform of the Nim-squares sequence {0,1,3,2,6,7,5,4,13,12,14,...}.A060147
Nim-binomial transform of the Nim-squares sequence {0,1,3,2,6,7,5,4,13,12,14,...}.
- Number of closed forest meander systems with 2n crossings.A060148
Number of closed forest meander systems with 2n crossings.
- Number of homogeneous generators of degree n for graded algebra associated with meanders.A060149
Number of homogeneous generators of degree n for graded algebra associated with meanders.
- a(0) = 1; for n > 0, binomial(2n-1, n-1)^2.A060150
a(0) = 1; for n > 0, binomial(2n-1, n-1)^2.
- Number of base n digits required to write n!.A060151
Number of base n digits required to write n!.
- Nim-factorial(a(n))=1.A060152
Nim-factorial(a(n))=1.
- Duplicate of A055010.A060153
Duplicate of A055010.
- Table T(n,k) by antidiagonals of n^k mod k [n,k >= 1].A060154
Table T(n,k) by antidiagonals of n^k mod k [n,k >= 1].
- Table T(n,k) by antidiagonals of floor(n^k/k) [n,k >= 1].A060155
Table T(n,k) by antidiagonals of floor(n^k/k) [n,k >= 1].
- a(n) = floor(10^n/n).A060156
a(n) = floor(10^n/n).
- Number of permutations of [n] with 3 sequences.A060157
Number of permutations of [n] with 3 sequences.
- Number of permutations of [n] with 4 sequences.A060158
Number of permutations of [n] with 4 sequences.
- a(n) = initial term of the smallest tuple of exactly n consecutive Harshad numbers.A060159
a(n) = initial term of the smallest tuple of exactly n consecutive Harshad numbers.
- a(n) = 2^n - 1 + Fibonacci(n-1)*2^(n+1).A060160
a(n) = 2^n - 1 + Fibonacci(n-1)*2^(n+1).