Sequences
392,541 sequences
- Number of orbits into which the Foata transform partitions the symmetric group Sn, i.e., a(n) is the number of cycles in the permutations A065181 - A065184 found in range [0,n!-1].A065161
Number of orbits into which the Foata transform partitions the symmetric group Sn, i.e., a(n) is the number of cycles in the permutations A065181 - A065184 found in range [0,n!-1].
- Least common multiple of all orbit sizes (cycle lengths in corresponding permutations A065181-A065184) into which the Foata transform partitions the symmetric group Sn.A065162
Least common multiple of all orbit sizes (cycle lengths in corresponding permutations A065181-A065184) into which the Foata transform partitions the symmetric group Sn.
- Maximal orbit size in the symmetric group partitioned by the upper records version of the Foata transform (i.e., a(n) is the maximum cycle length found in the corresponding permutations A065181-A065184 in range [0, n!-1]).A065163
Maximal orbit size in the symmetric group partitioned by the upper records version of the Foata transform (i.e., a(n) is the maximum cycle length found in the corresponding permutations A065181-A065184 in range [0, n!-1]).
- Permutation t->t+1 of Z, folded to N.A065164
Permutation t->t+1 of Z, folded to N.
- Permutation t->t+2 of Z, folded to N.A065165
Permutation t->t+2 of Z, folded to N.
- Permutation t->t+3 of Z, folded to N.A065166
Permutation t->t+3 of Z, folded to N.
- Table T(n,k) read by antidiagonals, where the k-th row gives the permutation t->t+k of Z, folded to N (k >= 0, n >= 1).A065167
Table T(n,k) read by antidiagonals, where the k-th row gives the permutation t->t+k of Z, folded to N (k >= 0, n >= 1).
- Permutation t->t-1 of Z, folded to N.A065168
Permutation t->t-1 of Z, folded to N.
- Permutation t->t-2 of Z, folded to N.A065169
Permutation t->t-2 of Z, folded to N.
- Permutation t->t-3 of Z, folded to N.A065170
Permutation t->t-3 of Z, folded to N.
- Permutation of Z, folded to N, corresponding to the site swap pattern ...26120123456... which ascends infinitely after t=0.A065171
Permutation of Z, folded to N, corresponding to the site swap pattern ...26120123456... which ascends infinitely after t=0.
- Inverse permutation to A065171.A065172
Inverse permutation to A065171.
- Site swap sequence that rises infinitely after t=0. The associated delta sequence p(t)-t for the permutation of Z: A065171.A065173
Site swap sequence that rises infinitely after t=0. The associated delta sequence p(t)-t for the permutation of Z: A065171.
- Permutation of Z, folded to N, corresponding to the site swap pattern ...242824202428242... (A065176).A065174
Permutation of Z, folded to N, corresponding to the site swap pattern ...242824202428242... (A065176).
- Inverse permutation to A065174.A065175
Inverse permutation to A065174.
- Site swap sequence associated with the permutation A065174 of Z.A065176
Site swap sequence associated with the permutation A065174 of Z.
- Table M(n,b) (columns: n >= 1, rows: b >= 0) gives the number of site swap juggling patterns with exact period n, using exactly b balls, where cyclic shifts are not counted as distinct.A065177
Table M(n,b) (columns: n >= 1, rows: b >= 0) gives the number of site swap juggling patterns with exact period n, using exactly b balls, where cyclic shifts are not counted as distinct.
- Number of site swap patterns with 2 balls and exact period n.A065178
Number of site swap patterns with 2 balls and exact period n.
- Number of site swap patterns with 3 balls and exact period n.A065179
Number of site swap patterns with 3 balls and exact period n.
- Number of site swap patterns with 4 balls and exact period n.A065180
Number of site swap patterns with 4 balls and exact period n.
- Permutation of nonnegative integers produced when the finite permutations listed by A055089 are subjected to inverse of Foata's transformation. Inverse of A065182.A065181
Permutation of nonnegative integers produced when the finite permutations listed by A055089 are subjected to inverse of Foata's transformation. Inverse of A065182.
- Permutation of nonnegative integers produced when the finite permutations listed by A055089 are subjected to Foata transform. Inverse of A065181.A065182
Permutation of nonnegative integers produced when the finite permutations listed by A055089 are subjected to Foata transform. Inverse of A065181.
- Permutation of nonnegative integers produced when the finite permutations listed by A060117 are subjected to the inverse of (variant of) Foata's transformation. Inverse of A065184.A065183
Permutation of nonnegative integers produced when the finite permutations listed by A060117 are subjected to the inverse of (variant of) Foata's transformation. Inverse of A065184.
- Permutation of nonnegative integers produced when the finite permutations listed by A060117 are subjected to the left-right maxima variant of Foata's transformation. Inverse of A065183.A065184
Permutation of nonnegative integers produced when the finite permutations listed by A060117 are subjected to the left-right maxima variant of Foata's transformation. Inverse of A065183.
- The delta sequence p(i)-i for the "Greedy Queens" permutation A065188. Each queen at file n is situated at rank n+a(n).A065185
The delta sequence p(i)-i for the "Greedy Queens" permutation A065188. Each queen at file n is situated at rank n+a(n).
- a(1)=1, a(2)=3, a(3)=5, a(4)=2, a(5)=4; for n > 5, a(n) = a(n-5) + 5.A065186
a(1)=1, a(2)=3, a(3)=5, a(4)=2, a(5)=4; for n > 5, a(n) = a(n-5) + 5.
- "Greedy Dragons" permutation of the natural numbers, inverse of A065186.A065187
"Greedy Dragons" permutation of the natural numbers, inverse of A065186.
- "Greedy Queens" permutation of the positive integers.A065188
"Greedy Queens" permutation of the positive integers.
- "Greedy Queens" permutation of the natural numbers, inverse of A065188.A065189
"Greedy Queens" permutation of the natural numbers, inverse of A065188.
- Self-inverse permutation of the positive integers: 1 is fixed, followed by an infinite number of adjacent transpositions (n n+1).A065190
Self-inverse permutation of the positive integers: 1 is fixed, followed by an infinite number of adjacent transpositions (n n+1).
- Limit of the recursion B_[k] = T[k](B_[k-1]), where B_[1] = (1,2,3,4,5,...) and T[k] is the transformation that permutes the entries k(2i-1) + j and k(2i) + j for all j = 0,..,k-1 and positive integers i.A065191
Limit of the recursion B_[k] = T[k](B_[k-1]), where B_[1] = (1,2,3,4,5,...) and T[k] is the transformation that permutes the entries k(2i-1) + j and k(2i) + j for all j = 0,..,k-1 and positive integers i.
- Record entries in A065191.A065192
Record entries in A065191.
- Indices of record entries (A065192) in A065191.A065193
Indices of record entries (A065192) in A065191.
- Limits of the recursion b(i+1)=B_[i](b(i)), where b(1)=n and B_[k+1](j) = B_[k](j), if j <= k; B_[k+1](j) = B_[k](j) + k, if j < k and (j mod 2k) >= k; B_[k+1](j) = B_[k](j) - k, if j < k and (j mod 2k) < k. Set a(n)=0 if b tends to infinity.A065194
Limits of the recursion b(i+1)=B_[i](b(i)), where b(1)=n and B_[k+1](j) = B_[k](j), if j <= k; B_[k+1](j) = B_[k](j) + k, if j < k and (j mod 2k) >= k; B_[k+1](j) = B_[k](j) - k, if j < k and (j mod 2k) < k. Set a(n)=0 if b tends to infinity.
- Record entries in A065194.A065195
Record entries in A065194.
- Indices of record entries (A065195) in A065194.A065196
Indices of record entries (A065195) in A065194.
- Fixed points of A065191.A065197
Fixed points of A065191.
- Indices of record high values in A033665, ignoring those numbers that are believed never to reach a palindrome.A065198
Indices of record high values in A033665, ignoring those numbers that are believed never to reach a palindrome.
- Record high values in A033665, ignoring those numbers that are believed never to reach a palindrome.A065199
Record high values in A033665, ignoring those numbers that are believed never to reach a palindrome.
- Numbers of the form m * p^k, with p prime, k >= 0, m squarefree and p > any prime factor of m.A065200
Numbers of the form m * p^k, with p prime, k >= 0, m squarefree and p > any prime factor of m.
- Numbers having a non-maximal prime-factor with exponent greater than 1.A065201
Numbers having a non-maximal prime-factor with exponent greater than 1.
- Characteristic function of A065201: a(n) = if A065201(k) = n for some k then 1 else 0.A065202
Characteristic function of A065201: a(n) = if A065201(k) = n for some k then 1 else 0.
- Total number of primes (without multiplicity) dividing A064413(n).A065203
Total number of primes (without multiplicity) dividing A064413(n).
- Least m such that A065203(m) = n.A065204
Least m such that A065203(m) = n.
- Number of subsets of proper divisors of n that sum to n.A065205
Number of subsets of proper divisors of n that sum to n.
- Numbers which need one 'Reverse and Add' step to reach a palindrome.A065206
Numbers which need one 'Reverse and Add' step to reach a palindrome.
- Numbers which need two 'Reverse and Add' steps to reach a palindrome.A065207
Numbers which need two 'Reverse and Add' steps to reach a palindrome.
- Numbers which need three 'Reverse and Add' steps to reach a palindrome.A065208
Numbers which need three 'Reverse and Add' steps to reach a palindrome.
- Numbers which need four 'Reverse and Add' steps to reach a palindrome.A065209
Numbers which need four 'Reverse and Add' steps to reach a palindrome.
- Numbers which need five 'Reverse and Add' steps to reach a palindrome.A065210
Numbers which need five 'Reverse and Add' steps to reach a palindrome.