Sequences
392,541 sequences
- Ordered products of the sides of primitive Pythagorean triangles.A063011
Ordered products of the sides of primitive Pythagorean triangles.
- Sum of distinct powers of 20; i.e., numbers with digits in {0,1} base 20; i.e., write n in base 2 and read as if written in base 20.A063012
Sum of distinct powers of 20; i.e., numbers with digits in {0,1} base 20; i.e., write n in base 2 and read as if written in base 20.
- Numbers where k-th digit from right is either 0 or k.A063013
Numbers where k-th digit from right is either 0 or k.
- Number of solutions to n^2 = b^2 + c^2 (with c >= b >= 0).A063014
Number of solutions to n^2 = b^2 + c^2 (with c >= b >= 0).
- Numbers k such that k + mu(k) is prime.A063015
Numbers k such that k + mu(k) is prime.
- a(n) is the product of Catalan(n) and (2^(n+1) - 1).A063016
a(n) is the product of Catalan(n) and (2^(n+1) - 1).
- a(n) = Catalan(n)*(3^(n+1) - 2^(n+1) + 1)/2.A063017
a(n) = Catalan(n)*(3^(n+1) - 2^(n+1) + 1)/2.
- Reversion of x - x^2 - x^3 - x^4.A063018
Reversion of x - x^2 - x^3 - x^4.
- Reversion of y - y^2 + y^3 - y^4.A063019
Reversion of y - y^2 + y^3 - y^4.
- Reversion of y - y^2 - y^3 + y^4.A063020
Reversion of y - y^2 - y^3 + y^4.
- Reversion of y - y^2 - y^5.A063021
Reversion of y - y^2 - y^5.
- Reversion of y - y^2 - y^3 - y^5.A063022
Reversion of y - y^2 - y^3 - y^5.
- Reversion of y - y^2 - y^4 - y^5.A063023
Reversion of y - y^2 - y^4 - y^5.
- Reversion of y - y^2 - y^3 - y^4 - y^5.A063024
Reversion of y - y^2 - y^3 - y^4 - y^5.
- Reversion of y - y^2 + y^3 - y^4 - y^5.A063025
Reversion of y - y^2 + y^3 - y^4 - y^5.
- Reversion of y - y^2 + y^4 - y^5.A063026
Reversion of y - y^2 + y^4 - y^5.
- Reversion of y - y^2 - y^3 + y^4 - y^5.A063027
Reversion of y - y^2 - y^3 + y^4 - y^5.
- Reversion of x - x^2 + x^5.A063028
Reversion of x - x^2 + x^5.
- Reversion of y - y^2 - y^3 + y^5.A063029
Reversion of y - y^2 - y^3 + y^5.
- Reversion of y - y^2 - y^4 + y^5.A063030
Reversion of y - y^2 - y^4 + y^5.
- Reversion of y - y^2 - y^3 - y^4 + y^5.A063031
Reversion of y - y^2 - y^3 - y^4 + y^5.
- Reversion of y - y^2 - y^3 + y^4 + y^5.A063032
Reversion of y - y^2 - y^3 + y^4 + y^5.
- Reversion of y - y^2 + y^4.A063033
Reversion of y - y^2 + y^4.
- Reversion of y - y^2 + y^4 + y^5.A063034
Reversion of y - y^2 + y^4 + y^5.
- Number of integers <= 10^n that contain a square factor (i.e., belong to A013929).A063035
Number of integers <= 10^n that contain a square factor (i.e., belong to A013929).
- Difference between average of smallest prime greater than n^3 and largest prime less than (n+1)^3 and n-th pronic [=n(n+1)].A063036
Difference between average of smallest prime greater than n^3 and largest prime less than (n+1)^3 and n-th pronic [=n(n+1)].
- Numbers without 3 consecutive equal binary digits.A063037
Numbers without 3 consecutive equal binary digits.
- a(n) = floor(n*sqrt(n)) - d(n), where d(n) is the number of divisors function.A063038
a(n) = floor(n*sqrt(n)) - d(n), where d(n) is the number of divisors function.
- LCM of unsigned Stirling numbers of the first kind, s(n,k) for 1 <= k <= n; s(n,k) = number of permutations of {1,2,..,n} with k cycles.A063039
LCM of unsigned Stirling numbers of the first kind, s(n,k) for 1 <= k <= n; s(n,k) = number of permutations of {1,2,..,n} with k cycles.
- LCM of Stirling numbers of the second kind, S(n,k) for 1 <= k <= n; S(n,k) = number of partitions of {1,2,...,n} with k blocks.A063040
LCM of Stirling numbers of the second kind, S(n,k) for 1 <= k <= n; S(n,k) = number of partitions of {1,2,...,n} with k blocks.
- Image of n under Collatz-2 map, a generalization of the classical '3x+1' - function: instead of dividing an even number by 2 a nonprime will be divided by its smallest prime factor and a prime will be multiplied not by 3 but by its prime-predecessor, before one is added.A063041
Image of n under Collatz-2 map, a generalization of the classical '3x+1' - function: instead of dividing an even number by 2 a nonprime will be divided by its smallest prime factor and a prime will be multiplied not by 3 but by its prime-predecessor, before one is added.
- Collatz-2 (A063041) trajectory starting at 3.A063042
Collatz-2 (A063041) trajectory starting at 3.
- Collatz-2 (A063041) trajectory starting at 17.A063043
Collatz-2 (A063041) trajectory starting at 17.
- Collatz-2 (A063041) trajectory starting at 29.A063044
Collatz-2 (A063041) trajectory starting at 29.
- Largest value in Collatz-2 (A063041) trajectory starting at n.A063045
Largest value in Collatz-2 (A063041) trajectory starting at n.
- Length of non-periodic head in Collatz-2 (A063041) trajectory starting at n.A063046
Length of non-periodic head in Collatz-2 (A063041) trajectory starting at n.
- Minimum m where (c_n)^m is mutinous (i.e., part of sequence A027854), where c_n is the n-th positive integer not a prime power.A063047
Minimum m where (c_n)^m is mutinous (i.e., part of sequence A027854), where c_n is the n-th positive integer not a prime power.
- Numbers n such that the Reverse and Add! trajectory of n (presumably) does not reach a palindrome and does not join the trajectory of any term m < n.A063048
Numbers n such that the Reverse and Add! trajectory of n (presumably) does not reach a palindrome and does not join the trajectory of any term m < n.
- Integers n > 196 such that the 'Reverse and Add!' trajectory of n joins the trajectory of 196.A063049
Integers n > 196 such that the 'Reverse and Add!' trajectory of n joins the trajectory of 196.
- a(n) = number of 'Reverse and Add!' operations that have to be applied to the n-th term of A063049 in order to obtain a term in the trajectory of 196.A063050
a(n) = number of 'Reverse and Add!' operations that have to be applied to the n-th term of A063049 in order to obtain a term in the trajectory of 196.
- 'Reverse and Add!' trajectory of 879.A063051
'Reverse and Add!' trajectory of 879.
- Integers n > 879 such that the 'Reverse and Add!' trajectory of n joins the trajectory of 879.A063052
Integers n > 879 such that the 'Reverse and Add!' trajectory of n joins the trajectory of 879.
- a(n) = number of 'Reverse and Add!' operations that have to be applied to the n-th term of A063052 in order to obtain a term in the trajectory of 879.A063053
a(n) = number of 'Reverse and Add!' operations that have to be applied to the n-th term of A063052 in order to obtain a term in the trajectory of 879.
- 'Reverse and Add!' trajectory of 1997.A063054
'Reverse and Add!' trajectory of 1997.
- Integers n > 1997 such that the 'Reverse and Add!' trajectory of n joins the trajectory of 1997.A063055
Integers n > 1997 such that the 'Reverse and Add!' trajectory of n joins the trajectory of 1997.
- a(n) = number of 'Reverse and Add!' operations that have to be applied to the n-th term of A063055 in order to obtain a term in the trajectory of 1997.A063056
a(n) = number of 'Reverse and Add!' operations that have to be applied to the n-th term of A063055 in order to obtain a term in the trajectory of 1997.
- 'Reverse and Add!' trajectory of 7059.A063057
'Reverse and Add!' trajectory of 7059.
- Integers n > 7059 such that the 'Reverse and Add!' trajectory of n joins the trajectory of 7059.A063058
Integers n > 7059 such that the 'Reverse and Add!' trajectory of n joins the trajectory of 7059.
- a(n) = number of 'Reverse and Add!' operations that have to be applied to the n-th term of A063058 in order to obtain a term in the trajectory of 7059.A063059
a(n) = number of 'Reverse and Add!' operations that have to be applied to the n-th term of A063058 in order to obtain a term in the trajectory of 7059.
- 'Reverse and Add!' trajectory of 10553.A063060
'Reverse and Add!' trajectory of 10553.