Sequences
392,541 sequences
- Permutation of natural numbers: rotations of all branches of the rooted plane trees encoded by A014486.A057511
Permutation of natural numbers: rotations of all branches of the rooted plane trees encoded by A014486.
- Permutation of natural numbers: rotations of all branches of the rooted plane trees encoded by A014486. (to opposite direction of A057511).A057512
Permutation of natural numbers: rotations of all branches of the rooted plane trees encoded by A014486. (to opposite direction of A057511).
- Number of separate orbits to which permutations given in A057511/A057512 (induced by deep rotation of general parenthesizations/plane trees) partition each A000108(n) objects encoded by A014486 between (A014138(n-1)+1)-th and (A014138(n))-th terms.A057513
Number of separate orbits to which permutations given in A057511/A057512 (induced by deep rotation of general parenthesizations/plane trees) partition each A000108(n) objects encoded by A014486 between (A014138(n-1)+1)-th and (A014138(n))-th terms.
- Number of peaks in mountain ranges encoded by A014486, number of leaves in the corresponding rooted plane trees (the root node is never counted as a leaf).A057514
Number of peaks in mountain ranges encoded by A014486, number of leaves in the corresponding rooted plane trees (the root node is never counted as a leaf).
- Number of separate "mountains" in mountain ranges encoded by A014486, number of bottom branches (trunks) in the corresponding rooted plane trees, i.e., the degree of the root node.A057515
Number of separate "mountains" in mountain ranges encoded by A014486, number of bottom branches (trunks) in the corresponding rooted plane trees, i.e., the degree of the root node.
- Number of sea-level valleys in Catalan mountain ranges encoded by A014486.A057516
Number of sea-level valleys in Catalan mountain ranges encoded by A014486.
- Binary encodings of the Catalan mountain ranges with exactly one sea-level valley, i.e., the rooted plane trees with root degree = 2.A057517
Binary encodings of the Catalan mountain ranges with exactly one sea-level valley, i.e., the rooted plane trees with root degree = 2.
- The global ranks of each term of A057517, i.e., tells that A057515(A057518(n)) = 2 for all n.A057518
The global ranks of each term of A057517, i.e., tells that A057515(A057518(n)) = 2 for all n.
- The local ranks of each term of A057517.A057519
The local ranks of each term of A057517.
- a(n) = A014486(n)/2. In binary expansion there is one more 1 than 0 and reading from the left (the most significant bit) to right, the number of 0's never exceed the number of 1's.A057520
a(n) = A014486(n)/2. In binary expansion there is one more 1 than 0 and reading from the left (the most significant bit) to right, the number of 0's never exceed the number of 1's.
- Powerful part of n: if n = Product_i (pi^ei) then a(n) = Product_{i : ei > 1} (pi^ei); if n = b*c^2*d^3 then a(n) = c^2*d^3 when b is minimized.A057521
Powerful part of n: if n = Product_i (pi^ei) then a(n) = Product_{i : ei > 1} (pi^ei); if n = b*c^2*d^3 then a(n) = c^2*d^3 when b is minimized.
- a(n+1) = a(n)/2 if 2|a(n), a(n)/3 if 3|a(n), a(n)/5 if 5|a(n), a(n)/7 if 7|a(n), a(n)/11 if 11|a(n), otherwise 13*a(n)+1.A057522
a(n+1) = a(n)/2 if 2|a(n), a(n)/3 if 3|a(n), a(n)/5 if 5|a(n), a(n)/7 if 7|a(n), a(n)/11 if 11|a(n), otherwise 13*a(n)+1.
- Number of ways n-th powerful (1) number can be expressed as b^2*c^3.A057523
Number of ways n-th powerful (1) number can be expressed as b^2*c^3.
- Number of 3 x n binary matrices without unit columns up to row and column permutations.A057524
Number of 3 x n binary matrices without unit columns up to row and column permutations.
- Number of applications of f to reduce n to 1, where f(k) is the integer among k/2,(k+1)/4, (k+3)/4.A057525
Number of applications of f to reduce n to 1, where f(k) is the integer among k/2,(k+1)/4, (k+3)/4.
- Number of applications of f to reduce n to 1, where f(k) is the integer among k/2,(k-1)/4, (k+1)/4.A057526
Number of applications of f to reduce n to 1, where f(k) is the integer among k/2,(k-1)/4, (k+1)/4.
- 4th level factorials: product of first n superduperfactorials.A057527
4th level factorials: product of first n superduperfactorials.
- 5th level factorials: product of first n 4th level factorials.A057528
5th level factorials: product of first n 4th level factorials.
- Numbers n with property that n is divisible by the number of divisors of n and by the sum of the digits of n.A057529
Numbers n with property that n is divisible by the number of divisors of n and by the sum of the digits of n.
- n is odd and divisible by number of divisors of n and sum of digits of n.A057530
n is odd and divisible by number of divisors of n and sum of digits of n.
- Numbers whose sum of digits and number of divisors are equal.A057531
Numbers whose sum of digits and number of divisors are equal.
- n is odd and sum of digits of n equals the numbers of divisors of n.A057532
n is odd and sum of digits of n equals the numbers of divisors of n.
- Values of n for which iteration of Chowla's function loops.A057533
Values of n for which iteration of Chowla's function loops.
- a(n+1) = a(n)/2 if 2|a(n), a(n)/3 if 3|a(n), a(n)/5 if 5|a(n), a(n)/7 if 7|a(n), a(n)/11 if 11|a(n), a(n)/13 if 13|a(n), otherwise 17*a(n)+1.A057534
a(n+1) = a(n)/2 if 2|a(n), a(n)/3 if 3|a(n), a(n)/5 if 5|a(n), a(n)/7 if 7|a(n), a(n)/11 if 11|a(n), a(n)/13 if 13|a(n), otherwise 17*a(n)+1.
- Numbers expressible as (a^2 - 1)*(b^2 - 1) in 5 distinct ways.A057535
Numbers expressible as (a^2 - 1)*(b^2 - 1) in 5 distinct ways.
- Minimal number of coins needed to pay n Euro-cents using the Euro currency.A057536
Minimal number of coins needed to pay n Euro-cents using the Euro currency.
- Number of ways of making change for n Euro-cents using the Euro currency.A057537
Number of ways of making change for n Euro-cents using the Euro currency.
- Birthday set of order 5: numbers congruent to +-1 modulo 2, 3, 4 and 5.A057538
Birthday set of order 5: numbers congruent to +-1 modulo 2, 3, 4 and 5.
- Birthday set of order 7, i.e., numbers congruent to +- 1 modulo 2, 3, 4, 5, 6 and 7.A057539
Birthday set of order 7, i.e., numbers congruent to +- 1 modulo 2, 3, 4, 5, 6 and 7.
- Birthday set of order 8: i.e., numbers congruent to +- 1 modulo 2, 3, 4, 5, 6, 7 and 8.A057540
Birthday set of order 8: i.e., numbers congruent to +- 1 modulo 2, 3, 4, 5, 6, 7 and 8.
- Birthday set of order 9: i.e., numbers congruent to +- 1 modulo 2, 3, 4, 5, 6, 7, 8 and 9.A057541
Birthday set of order 9: i.e., numbers congruent to +- 1 modulo 2, 3, 4, 5, 6, 7, 8 and 9.
- Maximum cycle length in each permutation between A038776(1) and A038776(A000108(n)).A057542
Maximum cycle length in each permutation between A038776(1) and A038776(A000108(n)).
- Maximum cycle length (orbit size) in the rotation permutation of 2n non-crossing handshakes.A057543
Maximum cycle length (orbit size) in the rotation permutation of 2n non-crossing handshakes.
- Maximum cycle length (orbit size) in the rotation permutation of n+2 side polygon triangularizations.A057544
Maximum cycle length (orbit size) in the rotation permutation of n+2 side polygon triangularizations.
- Maximum cycle size in range [A014137(n-1)..A014138(n-1)] of permutation A057505/A057506.A057545
Maximum cycle size in range [A014137(n-1)..A014138(n-1)] of permutation A057505/A057506.
- Number of Catalan objects of size n fixed by Catalan Automorphism A057511/A057512 (deep rotation of general parenthesizations/plane trees).A057546
Number of Catalan objects of size n fixed by Catalan Automorphism A057511/A057512 (deep rotation of general parenthesizations/plane trees).
- A014486-encodings of Catalan mountain ranges with no sea-level valleys, i.e., the rooted plane general trees with root degree = 1.A057547
A014486-encodings of Catalan mountain ranges with no sea-level valleys, i.e., the rooted plane general trees with root degree = 1.
- A014486-indices of Catalan mountain ranges with no sea-level valleys, i.e., the rooted plane general trees with root degree = 1.A057548
A014486-indices of Catalan mountain ranges with no sea-level valleys, i.e., the rooted plane general trees with root degree = 1.
- The local ranks of each term of A057547.A057549
The local ranks of each term of A057547.
- First differences of A057549.A057550
First differences of A057549.
- First differences of A057548.A057551
First differences of A057548.
- a(n) = Sum_{k=0..n} C(2k+2,k).A057552
a(n) = Sum_{k=0..n} C(2k+2,k).
- Rank of (1,1,...,1) (n 1's) when {0,1,2,...}^n is lexicographically ordered.A057553
Rank of (1,1,...,1) (n 1's) when {0,1,2,...}^n is lexicographically ordered.
- Lexicographic ordering of MxM, where M={0,1,2,...}.A057554
Lexicographic ordering of MxM, where M={0,1,2,...}.
- Lexicographic ordering of N x N, where N = {1,2,3...}.A057555
Lexicographic ordering of N x N, where N = {1,2,3...}.
- Lexicographic ordering of M x M x M, where M={0,1,2,...}.A057556
Lexicographic ordering of M x M x M, where M={0,1,2,...}.
- Lexicographic ordering of NxNxN, where N={1,2,3,...}.A057557
Lexicographic ordering of NxNxN, where N={1,2,3,...}.
- Lexicographic ordering of MxMxMxM, where M={0,1,2,...}.A057558
Lexicographic ordering of MxMxMxM, where M={0,1,2,...}.
- Lexicographic ordering of NxNxNxN, where N={1,2,3,...}.A057559
Lexicographic ordering of NxNxNxN, where N={1,2,3,...}.
- Weakly distance-regular digraphs on n nodes (excluding distance-regular graphs).A057560
Weakly distance-regular digraphs on n nodes (excluding distance-regular graphs).