Sequences
392,541 sequences
- a(n) = prime(n+pi(n)) - prime(n) = A000040(n+A000720(n)) - A000040(n).A082911
a(n) = prime(n+pi(n)) - prime(n) = A000040(n+A000720(n)) - A000040(n).
- Least k such that H(k) > 10^n, where H(k) is the harmonic number Sum_{i=1..k} 1/i.A082912
Least k such that H(k) > 10^n, where H(k) is the harmonic number Sum_{i=1..k} 1/i.
- Least k such that H(k) > 2^n, where H(k) is the harmonic number Sum_{i=1..k} 1/i.A082913
Least k such that H(k) > 2^n, where H(k) is the harmonic number Sum_{i=1..k} 1/i.
- a(n) = n! / A003040(n).A082914
a(n) = n! / A003040(n).
- Numbers n for which the first difference sequence of A054040 decreases.A082915
Numbers n for which the first difference sequence of A054040 decreases.
- Numbers k such that k and binomial(2*k, k) are relatively prime.A082916
Numbers k such that k and binomial(2*k, k) are relatively prime.
- Numbers that can be expressed as the sum of two odd primes in more ways than any smaller even number.A082917
Numbers that can be expressed as the sum of two odd primes in more ways than any smaller even number.
- Record-setting entries in A002375 (number of decompositions into two odd primes).A082918
Record-setting entries in A002375 (number of decompositions into two odd primes).
- Numbers k such that k, k+2, k+4, k+6, k+8, k+10, k+12 and k+14 are semiprimes.A082919
Numbers k such that k, k+2, k+4, k+6, k+8, k+10, k+12 and k+14 are semiprimes.
- Squares that are the sum of four factorials.A082920
Squares that are the sum of four factorials.
- Sort the digits of these squares into descending order and drop zeros to get primes.A082921
Sort the digits of these squares into descending order and drop zeros to get primes.
- Numbers n such that when the digits of Fibonacci(n) are sorted into decreasing order and zeros are dropped it is a prime.A082922
Numbers n such that when the digits of Fibonacci(n) are sorted into decreasing order and zeros are dropped it is a prime.
- Sort the digits of these triangular numbers into descending order and drop zeros to get primes.A082923
Sort the digits of these triangular numbers into descending order and drop zeros to get primes.
- For n prime, a(n) = n+1; for n even and > 2, a(n) = n/2; otherwise a(n) = 3*n.A082924
For n prime, a(n) = n+1; for n even and > 2, a(n) = n/2; otherwise a(n) = 3*n.
- Partial sums of A082924.A082925
Partial sums of A082924.
- Difference between the number of primes equal to or less than n and (1 + the number of nonsquarefree numbers equal to or less than n).A082926
Difference between the number of primes equal to or less than n and (1 + the number of nonsquarefree numbers equal to or less than n).
- Numbers in which at least one pair of adjacent digits differ by 1.A082927
Numbers in which at least one pair of adjacent digits differ by 1.
- If n is prime, a(n) = n+1; if n is even, a(n) = n/2; otherwise a(n) = n.A082928
If n is prime, a(n) = n+1; if n is even, a(n) = n/2; otherwise a(n) = n.
- Primes not of form A080435(i)+A080435(j).A082929
Primes not of form A080435(i)+A080435(j).
- Even elements of A080435.A082930
Even elements of A080435.
- a(1) = 1; a(n) = least k > a(n-1) such that a(i)+k is prime for some i < n and each prime of form a(i)+a(j) occurs for unique i <= j.A082931
a(1) = 1; a(n) = least k > a(n-1) such that a(i)+k is prime for some i < n and each prime of form a(i)+a(j) occurs for unique i <= j.
- Primes not of form A082931(i)+A082931(j).A082932
Primes not of form A082931(i)+A082931(j).
- Even elements of A082931.A082933
Even elements of A082931.
- A082928(1) + A082928(2) + ... + A082928(n).A082934
A082928(1) + A082928(2) + ... + A082928(n).
- Smallest palindrome beginning with n and a digit sum of n at some stage.A082935
Smallest palindrome beginning with n and a digit sum of n at some stage.
- a(n) = (1/(3*n))*Sum_{d|n, d even} phi(2*n/d)*binomial(3d/2,d).A082936
a(n) = (1/(3*n))*Sum_{d|n, d even} phi(2*n/d)*binomial(3d/2,d).
- Palindromes divisible by each of their digits.A082937
Palindromes divisible by each of their digits.
- Number of solid 2-trees with 2n+1 edges.A082938
Number of solid 2-trees with 2n+1 edges.
- Numbers such that sum of the digits of the product of the factorial of digits of the number is equal to the sum of the digits of the number.A082939
Numbers such that sum of the digits of the product of the factorial of digits of the number is equal to the sum of the digits of the number.
- Palindromes in A082939.A082940
Palindromes in A082939.
- a(n) is the odd-length palindrome whose digits up to the center are those of n and whose center digit is equal to the digital root of the product of the factorial of n and the reverse of n.A082941
a(n) is the odd-length palindrome whose digits up to the center are those of n and whose center digit is equal to the digital root of the product of the factorial of n and the reverse of n.
- a(n) = (n^2+1)*(4*n^2+1)*(4*n^2+3).A082942
a(n) = (n^2+1)*(4*n^2+1)*(4*n^2+3).
- Positive numbers not divisible by any of their digits nor by the sum of their digits.A082943
Positive numbers not divisible by any of their digits nor by the sum of their digits.
- a(n) = concatenate(n, A010888(2*n), reverse(n)), where A010888 = digital root.A082944
a(n) = concatenate(n, A010888(2*n), reverse(n)), where A010888 = digital root.
- Numbers n which in decimal have the form imj, where m is the middle digit, with property that j is the reversal of i, and i = m*j.A082945
Numbers n which in decimal have the form imj, where m is the middle digit, with property that j is the reversal of i, and i = m*j.
- Duplicate of A082945.A082946
Duplicate of A082945.
- Palindromes not divisible by any of their digits.A082947
Palindromes not divisible by any of their digits.
- Palindromes neither divisible by any of their digits nor by the sum of their digits.A082948
Palindromes neither divisible by any of their digits nor by the sum of their digits.
- Numbers of the form p^q * q^p, with distinct primes p and q.A082949
Numbers of the form p^q * q^p, with distinct primes p and q.
- Power base and exponent of n-th prime power exchanged.A082950
Power base and exponent of n-th prime power exchanged.
- Number of primitive (aperiodic) word structures of length n using an infinite alphabet.A082951
Number of primitive (aperiodic) word structures of length n using an infinite alphabet.
- Smaller of the two factors of the n-th semiprime number of the form m!+1.A082952
Smaller of the two factors of the n-th semiprime number of the form m!+1.
- a(n) = A000252(n) / A070732(n).A082953
a(n) = A000252(n) / A070732(n).
- Numbers k such that phi(k*sigma(k)) = phi(k)^2.A082954
Numbers k such that phi(k*sigma(k)) = phi(k)^2.
- Numbers k such that sigma(k*phi(k)) = sigma(k)^2.A082955
Numbers k such that sigma(k*phi(k)) = sigma(k)^2.
- Difference between C(n) and the first prime after C(n), where C(n) = A049614(n).A082956
Difference between C(n) and the first prime after C(n), where C(n) = A049614(n).
- Numbers n such that sigma(2n) < sigma(2n+1).A082957
Numbers n such that sigma(2n) < sigma(2n+1).
- Number of symmetric short bushes with n edges.A082958
Number of symmetric short bushes with n edges.
- Number of inequivalent optimal linear codes of length 2n over GF(4).A082959
Number of inequivalent optimal linear codes of length 2n over GF(4).
- Number of inequivalent optimal Hermitian self-dual codes of length 2n over GF(4).A082960
Number of inequivalent optimal Hermitian self-dual codes of length 2n over GF(4).