Sequences
392,541 sequences
- Least k such that prime(k) >= k*tau(k*n) where tau = A000005.A074811
Least k such that prime(k) >= k*tau(k*n) where tau = A000005.
- Smaller of 2 squares whose corresponding digits add to give 0 or 10 and neither square ends in 0's. (The smaller of two 10-complementary squares.)A074812
Smaller of 2 squares whose corresponding digits add to give 0 or 10 and neither square ends in 0's. (The smaller of two 10-complementary squares.)
- Number of primes between n and R(n) (inclusive), where R(n) (A004086) is the digit reversal of n.A074813
Number of primes between n and R(n) (inclusive), where R(n) (A004086) is the digit reversal of n.
- Numbers k such that the number of primes between k and 2k (inclusive) is equal to the number of primes between k and reverse(k) (inclusive).A074814
Numbers k such that the number of primes between k and 2k (inclusive) is equal to the number of primes between k and reverse(k) (inclusive).
- Numbers k such that there are no prime numbers between reverse(k) and 3*k.A074815
Numbers k such that there are no prime numbers between reverse(k) and 3*k.
- a(n) = 3^A001221(n) = 3^omega(n).A074816
a(n) = 3^A001221(n) = 3^omega(n).
- Numbers n such that the number of primes between n^2 and (n+1)^2 = the number of primes between n and Reverse(n) (inclusive).A074817
Numbers n such that the number of primes between n^2 and (n+1)^2 = the number of primes between n and Reverse(n) (inclusive).
- Number of integers in {1, 2, ..., prime(n)} that are coprime to n.A074818
Number of integers in {1, 2, ..., prime(n)} that are coprime to n.
- Numbers k such that mu(k)+mu(k+1) = 0.A074819
Numbers k such that mu(k)+mu(k+1) = 0.
- Numbers k such that mu(k) = mu(k+2), where mu is the Möbius function (A008683).A074820
Numbers k such that mu(k) = mu(k+2), where mu is the Möbius function (A008683).
- Numbers k such that tau(k) = tau(2k+1).A074821
Numbers k such that tau(k) = tau(2k+1).
- Primes p such that p + 4 is prime and p == 9 (mod 10).A074822
Primes p such that p + 4 is prime and p == 9 (mod 10).
- a(n) = 2^omega(n)*mu(n)^2.A074823
a(n) = 2^omega(n)*mu(n)^2.
- Numbers k such that 2^k + Fibonacci(k) is prime.A074824
Numbers k such that 2^k + Fibonacci(k) is prime.
- Binomial transform of reflected pentanacci numbers A074062: a(n) = Sum_{k=0..n} binomial(n,k)*A074062(k).A074825
Binomial transform of reflected pentanacci numbers A074062: a(n) = Sum_{k=0..n} binomial(n,k)*A074062(k).
- Binomial transform of reflected pentanacci numbers A074062: a(n) = Sum_{k=0..n}(-1)^k*binomial(n, k)*A074062(k).A074826
Binomial transform of reflected pentanacci numbers A074062: a(n) = Sum_{k=0..n}(-1)^k*binomial(n, k)*A074062(k).
- Numbers n such that tau(n) > tau(n+1) where tau(x) = A000005(x).A074827
Numbers n such that tau(n) > tau(n+1) where tau(x) = A000005(x).
- a(1) = 1; for n>1, a(n) = smallest composite multiple of n if n is a prime else the smallest prime divisor of n if n is composite.A074828
a(1) = 1; for n>1, a(n) = smallest composite multiple of n if n is a prime else the smallest prime divisor of n if n is composite.
- Triangle formed by Pascal's rule, except that the n-th row begins and ends with the n-th Fibonacci number.A074829
Triangle formed by Pascal's rule, except that the n-th row begins and ends with the n-th Fibonacci number.
- Number of base reversals which result in a prime for bases less than n.A074830
Number of base reversals which result in a prime for bases less than n.
- Number of binary reversal primes less than 10^n.A074831
Number of binary reversal primes less than 10^n.
- Primes whose binary reversal is also prime.A074832
Primes whose binary reversal is also prime.
- Primes whose ternary reversal is also prime.A074833
Primes whose ternary reversal is also prime.
- Primes whose base 4 reversal is also prime.A074834
Primes whose base 4 reversal is also prime.
- Numbers n such that sigma(phi(n)) = sum of anti-divisors of n.A074835
Numbers n such that sigma(phi(n)) = sum of anti-divisors of n.
- a(1) = 1, a(n) = the largest prime divisor of concatenation of sequence (n,n-1,..,2,1,2,..,n-1,n) A007942.A074836
a(1) = 1, a(n) = the largest prime divisor of concatenation of sequence (n,n-1,..,2,1,2,..,n-1,n) A007942.
- Numbers k such that the penultimate 3 divisors of k sum to k.A074837
Numbers k such that the penultimate 3 divisors of k sum to k.
- Numbers m such that sum(d|m, 1/core(d) ) is an integer where core(x) is the squarefree part of x.A074838
Numbers m such that sum(d|m, 1/core(d) ) is an integer where core(x) is the squarefree part of x.
- a(0) = 1, a(n+1) = a(n) + next prime larger than a(n).A074839
a(0) = 1, a(n+1) = a(n) + next prime larger than a(n).
- Numerators a(n) of fractions slowly converging to sqrt(2): let a(1) = 0, b(n) = n - a(n); if (a(n) + 1) / b(n) < sqrt(2), then a(n+1) = a(n) + 1, else a(n+1)= a(n).A074840
Numerators a(n) of fractions slowly converging to sqrt(2): let a(1) = 0, b(n) = n - a(n); if (a(n) + 1) / b(n) < sqrt(2), then a(n+1) = a(n) + 1, else a(n+1)= a(n).
- Square root of n contains n as a string of digits to the immediate right of the decimal point (excluding leading zeros).A074841
Square root of n contains n as a string of digits to the immediate right of the decimal point (excluding leading zeros).
- Triplets: base 10 representation is the juxtaposition of three identical strings.A074842
Triplets: base 10 representation is the juxtaposition of three identical strings.
- Quadruplets: base 10 representation is the juxtaposition of four identical strings.A074843
Quadruplets: base 10 representation is the juxtaposition of four identical strings.
- Largest difference between consecutive divisors of n is equal to the sum of divisors of n except 1 and n.A074844
Largest difference between consecutive divisors of n is equal to the sum of divisors of n except 1 and n.
- Numbers k such that S(k) = largest difference between consecutive divisors of k (ordered by size), where S(k) is the Kempner function (A002034).A074845
Numbers k such that S(k) = largest difference between consecutive divisors of k (ordered by size), where S(k) is the Kempner function (A002034).
- a(n) is the smallest k > n such that n*k+1 is prime.A074846
a(n) is the smallest k > n such that n*k+1 is prime.
- Sum of 4-infinitary divisors of n: if n=Product p(i)^r(i) and d=Product p(i)^s(i), each s(i) has a digit a<=b in its 4-ary expansion everywhere that the corresponding r(i) has a digit b, then d is a 4-infinitary-divisor of n.A074847
Sum of 4-infinitary divisors of n: if n=Product p(i)^r(i) and d=Product p(i)^s(i), each s(i) has a digit a<=b in its 4-ary expansion everywhere that the corresponding r(i) has a digit b, then d is a 4-infinitary-divisor of n.
- Number of 4-infinitary divisors of n.A074848
Number of 4-infinitary divisors of n.
- 4-infinitary perfect numbers: numbers k such that 4-infinitary-sigma(k) = 2*k.A074849
4-infinitary perfect numbers: numbers k such that 4-infinitary-sigma(k) = 2*k.
- Partial products of successive digits in the decimal expansion of Pi.A074850
Partial products of successive digits in the decimal expansion of Pi.
- Numbers k such that k and k+1 both have exactly 2 distinct prime factors.A074851
Numbers k such that k and k+1 both have exactly 2 distinct prime factors.
- Composite n such that n and n+2 are prime powers.A074852
Composite n such that n and n+2 are prime powers.
- Numbers k not in A065036 but such that tau(k) = omega(k)^3.A074853
Numbers k not in A065036 but such that tau(k) = omega(k)^3.
- a(n) = Sum_{d|n} (2^(n-d)).A074854
a(n) = Sum_{d|n} (2^(n-d)).
- Primes p such that all p-t for p/2 < t < p are nonprime, where t is a triangular number.A074855
Primes p such that all p-t for p/2 < t < p are nonprime, where t is a triangular number.
- Primes p such that all p-k^2 for p/2 < k^2 < p are nonprime.A074856
Primes p such that all p-k^2 for p/2 < k^2 < p are nonprime.
- Primes p such that all p-pal for p/2 < pal < p are nonprime, where pal is a palindrome.A074857
Primes p such that all p-pal for p/2 < pal < p are nonprime, where pal is a palindrome.
- a(n) = a(n-1) + a(n-2) + R(a(n-3)) where a(0) = a(1) = a(2) = 1 and R(n) (A004086) means the reverse of n.A074858
a(n) = a(n-1) + a(n-2) + R(a(n-3)) where a(0) = a(1) = a(2) = 1 and R(n) (A004086) means the reverse of n.
- Number of elements of S_n having the maximum possible order g(n), where g(n) is Landau's function (A000793).A074859
Number of elements of S_n having the maximum possible order g(n), where g(n) is Landau's function (A000793).
- a(n) = a(n-1) + R(a(n-2)) + R(a(n-3)) where a(0)=a(1)=a(2)=1 and R(k) = A004086(k) is the reverse of k.A074860
a(n) = a(n-1) + R(a(n-2)) + R(a(n-3)) where a(0)=a(1)=a(2)=1 and R(k) = A004086(k) is the reverse of k.