Sequences
392,541 sequences
- Numbers k such that A072010(k) = k.A072011
Numbers k such that A072010(k) = k.
- a(n) = A072010(A072010(n)).A072012
a(n) = A072010(A072010(n)).
- Numbers k such that A072012(k) = k.A072013
Numbers k such that A072012(k) = k.
- Minima when the mapping of A072010 is applied to n repeatedly.A072014
Minima when the mapping of A072010 is applied to n repeatedly.
- Maxima when the mapping of A072010 is applied to n repeatedly.A072015
Maxima when the mapping of A072010 is applied to n repeatedly.
- Numbers k such that gcd(k, reverse(k)) = 27 = 3^3, where reverse(x) = A004086(x).A072016
Numbers k such that gcd(k, reverse(k)) = 27 = 3^3, where reverse(x) = A004086(x).
- Numbers k such that gcd(k, reverse(k)) = 81 = 3^4, where reverse(x) = A004086(x).A072017
Numbers k such that gcd(k, reverse(k)) = 81 = 3^4, where reverse(x) = A004086(x).
- Numbers k for which gcd(k, reverse(k)) = 243 = 3^5.A072018
Numbers k for which gcd(k, reverse(k)) = 243 = 3^5.
- Generalized Bell numbers B_{5,2}.A072019
Generalized Bell numbers B_{5,2}.
- Sum of an infinite series: a(n) = Sum_{k = 0..infinity} ((1/27) * (3^n)^3 * Gamma(n+1/3*k+1/3) * Gamma(n+1/3*k+2/3) * Gamma(n+1/3*k+1)) / (Gamma(4/3+1/3*k) * Gamma(5/3+1/3*k) * Gamma(2+1/3*k) * exp(1) * k!).A072020
Sum of an infinite series: a(n) = Sum_{k = 0..infinity} ((1/27) * (3^n)^3 * Gamma(n+1/3*k+1/3) * Gamma(n+1/3*k+2/3) * Gamma(n+1/3*k+1)) / (Gamma(4/3+1/3*k) * Gamma(5/3+1/3*k) * Gamma(2+1/3*k) * exp(1) * k!).
- Smallest solution to gcd(x, reverse(x)) = 5^n.A072021
Smallest solution to gcd(x, reverse(x)) = 5^n.
- Smallest x such that the number of nonprimes (i.e., 1 and composites) in the reduced residue set (RSS(x)) of x equals n, or 0 if there are no such x.A072022
Smallest x such that the number of nonprimes (i.e., 1 and composites) in the reduced residue set (RSS(x)) of x equals n, or 0 if there are no such x.
- Values of k such that A072022(k)=0.A072023
Values of k such that A072022(k)=0.
- Table by antidiagonals of T(n,k) = ((n+1)^k - (-n)^k)/(2*n+1).A072024
Table by antidiagonals of T(n,k) = ((n+1)^k - (-n)^k)/(2*n+1).
- a(n) = n^4 + 2*n^3 + 4*n^2 + 3*n + 1 = ((n+1)^5+n^5) / (2*n+1).A072025
a(n) = n^4 + 2*n^3 + 4*n^2 + 3*n + 1 = ((n+1)^5+n^5) / (2*n+1).
- Swap twin prime pairs >(3,5) in prime factorization of n.A072026
Swap twin prime pairs >(3,5) in prime factorization of n.
- Swap (2,3) and all twin prime pairs >(3,5) in prime factorization of n.A072027
Swap (2,3) and all twin prime pairs >(3,5) in prime factorization of n.
- Swap twin prime pairs of form (4*k+1,4*k+3) in prime factorization of n.A072028
Swap twin prime pairs of form (4*k+1,4*k+3) in prime factorization of n.
- Swap twin prime pairs of form (4*k+3,4*(k+1)+1) in prime factorization of n.A072029
Swap twin prime pairs of form (4*k+3,4*(k+1)+1) in prime factorization of n.
- Array read by antidiagonals: T(n,k) = number of steps in simple Euclidean algorithm for gcd(n,k) where n >= 1, k >= 1.A072030
Array read by antidiagonals: T(n,k) = number of steps in simple Euclidean algorithm for gcd(n,k) where n >= 1, k >= 1.
- Row sums of A072030.A072031
Row sums of A072030.
- a(n) = gcd(2^n, reverse(2^n)) = gcd(2^n, A004086(2^n)) = A055483(2^n).A072032
a(n) = gcd(2^n, reverse(2^n)) = gcd(2^n, A004086(2^n)) = A055483(2^n).
- Smallest x > 0 such that gcd(2^x, A004086(2^x)) = 2^n.A072033
Smallest x > 0 such that gcd(2^x, A004086(2^x)) = 2^n.
- a(n) = Sum_{k=0..n} binomial(n,k)*k^n.A072034
a(n) = Sum_{k=0..n} binomial(n,k)*k^n.
- Sum(binomial(n,k)*n^k*k^n,k=1..n).A072035
Sum(binomial(n,k)*n^k*k^n,k=1..n).
- An unknown sequence.A072036
An unknown sequence.
- Palindromic powers (with positive exponents) of a prime but not a prime (A025475).A072037
Palindromic powers (with positive exponents) of a prime but not a prime (A025475).
- Column of Zorach additive triangle in which n appears (or 0 in the unlikely event that it does not).A072038
Column of Zorach additive triangle in which n appears (or 0 in the unlikely event that it does not).
- Row of Zorach additive triangle in which n appears (or 0 in the unlikely event that it does not).A072039
Row of Zorach additive triangle in which n appears (or 0 in the unlikely event that it does not).
- Numbers n of the form k + reverse(k) for exactly two k.A072040
Numbers n of the form k + reverse(k) for exactly two k.
- a(n) is the smallest number of the form k + reverse(k) for exactly n integers k, or -1 if no such number exists.A072041
a(n) is the smallest number of the form k + reverse(k) for exactly n integers k, or -1 if no such number exists.
- a(n+2) = a(n+1)*a(n)*(1+1/n), a(1)=a(2)=1.A072042
a(n+2) = a(n+1)*a(n)*(1+1/n), a(1)=a(2)=1.
- a(n) = a(n-1)*a(n-2)*a(n-3)*(1+1/(n-3)), a(1)=a(2)=a(3)=1.A072043
a(n) = a(n-1)*a(n-2)*a(n-3)*(1+1/(n-3)), a(1)=a(2)=a(3)=1.
- Numerator of Product{prime(k)^2/(prime(k)^2 - 1) | 0<k<=n}, Denominator: A072045.A072044
Numerator of Product{prime(k)^2/(prime(k)^2 - 1) | 0<k<=n}, Denominator: A072045.
- Denominator of Product{prime(k)^2/(prime(k)^2 - 1) | 0<k<=n}, Numerator: A072044.A072045
Denominator of Product{prime(k)^2/(prime(k)^2 - 1) | 0<k<=n}, Numerator: A072044.
- Greatest common divisor of product of divisors of n and product of non-divisors < n.A072046
Greatest common divisor of product of divisors of n and product of non-divisors < n.
- Number of prime factors of the squarefree numbers: omega(A005117(n)).A072047
Number of prime factors of the squarefree numbers: omega(A005117(n)).
- Number of divisors of the squarefree numbers: tau(A005117(n)).A072048
Number of divisors of the squarefree numbers: tau(A005117(n)).
- a(n) = floor(2^(n/(floor(n*log(2)/log(prime(n)))))).A072049
a(n) = floor(2^(n/(floor(n*log(2)/log(prime(n)))))).
- Smallest solution to GCD(x,A004086(x))=7^n.A072050
Smallest solution to GCD(x,A004086(x))=7^n.
- Smallest k such that gcd(k, reverse(k)) = 11^n.A072051
Smallest k such that gcd(k, reverse(k)) = 11^n.
- Largest of 3 integer distances referred to in A061281.A072052
Largest of 3 integer distances referred to in A061281.
- Median of 3 integer distances referred to in A061281.A072053
Median of 3 integer distances referred to in A061281.
- Smallest of 3 integer distances referred to in A061281.A072054
Smallest of 3 integer distances referred to in A061281.
- a(n) = 2*prime(n)+1.A072055
a(n) = 2*prime(n)+1.
- Number of divisors of 2*prime(n)+1.A072056
Number of divisors of 2*prime(n)+1.
- Sum of divisors of 2*prime(n)+1.A072057
Sum of divisors of 2*prime(n)+1.
- Squarefree kernel of 2*prime(n)+1.A072058
Squarefree kernel of 2*prime(n)+1.
- Smallest prime p such that 2*p+1 has n distinct prime factors.A072059
Smallest prime p such that 2*p+1 has n distinct prime factors.
- Smallest prime p such that 2*p+1 has n prime factors (with multiplicity).A072060
Smallest prime p such that 2*p+1 has n prime factors (with multiplicity).