Sequences
392,541 sequences
- Non-palindromic numbers whose decimal expansion is a concatenation of the form a_1 a_2 a_3 ... a_{k-1} a_k a_k a_{k-1} ... a_2 a_1 (k >= 1) or a_1 a_2 a_3 ... a_{k-1} a_k a_{k-1} ... a_2 a_1 (k >= 2) for positive integers a_1, ..., a_k. For i>1, a_i may have leading zeros.A082461
Non-palindromic numbers whose decimal expansion is a concatenation of the form a_1 a_2 a_3 ... a_{k-1} a_k a_k a_{k-1} ... a_2 a_1 (k >= 1) or a_1 a_2 a_3 ... a_{k-1} a_k a_{k-1} ... a_2 a_1 (k >= 2) for positive integers a_1, ..., a_k. For i>1, a_i may have leading zeros.
- Let chi(k) = 1 if prime(k+1) - prime(k) = 2, = 0 otherwise; sequence gives a(n) = Sum_{k <= n} chi(k).A082462
Let chi(k) = 1 if prime(k+1) - prime(k) = 2, = 0 otherwise; sequence gives a(n) = Sum_{k <= n} chi(k).
- Numbers k such that A072181(k) + 1 is prime.A082463
Numbers k such that A072181(k) + 1 is prime.
- Numbers k such that A072181(k) - 1 is prime.A082464
Numbers k such that A072181(k) - 1 is prime.
- Least k>=1 such that n^2+kn+1 is prime.A082465
Least k>=1 such that n^2+kn+1 is prime.
- Least k>=1 such that n^2+kn-1 and n^2+kn+1 are twin primes.A082466
Least k>=1 such that n^2+kn-1 and n^2+kn+1 are twin primes.
- Least k>0 such that n-k and n+k are both primes.A082467
Least k>0 such that n-k and n+k are both primes.
- a(n) is the smallest positive integer k such that A082467(k)=n.A082468
a(n) is the smallest positive integer k such that A082467(k)=n.
- If n==1 or mod(n,2)==0 or mod(n,5)==0 then -1, otherwise a(n) is the smallest nonnegative integer k such that the concatenation 1(k)2(k)3(k)...(k)n is a prime.A082469
If n==1 or mod(n,2)==0 or mod(n,5)==0 then -1, otherwise a(n) is the smallest nonnegative integer k such that the concatenation 1(k)2(k)3(k)...(k)n is a prime.
- a(n) is the number of k >= 0 such that k! + prime(n) is prime.A082470
a(n) is the number of k >= 0 such that k! + prime(n) is prime.
- a(1)=1, a(n) = Sum_{k=1..n-1} Fibonacci(k)*a(k).A082471
a(1)=1, a(n) = Sum_{k=1..n-1} Fibonacci(k)*a(k).
- a(1) = 1, a(n) = Sum_{k=1..n-1} a(k)*2^k.A082472
a(1) = 1, a(n) = Sum_{k=1..n-1} a(k)*2^k.
- Numbers n such that n = phi(x)*core(x) for some x <= n, where phi(x) is the Euler totient function and core(x) the squarefree part of x.A082473
Numbers n such that n = phi(x)*core(x) for some x <= n, where phi(x) is the Euler totient function and core(x) the squarefree part of x.
- Numbers n such that n=phi(x)*sigma(x) for some x<=n.A082474
Numbers n such that n=phi(x)*sigma(x) for some x<=n.
- Prime index i for consecutive primes p(i),p(i+1),p(i+2),p(i+3) that do not have a solution for the congruences p(i)^x+p(i+1)^x = p(i+2) mod p(i+3) and p(i+1)^x-p(i)^x = p(i+2) mod p(i+3).A082475
Prime index i for consecutive primes p(i),p(i+1),p(i+2),p(i+3) that do not have a solution for the congruences p(i)^x+p(i+1)^x = p(i+2) mod p(i+3) and p(i+1)^x-p(i)^x = p(i+2) mod p(i+3).
- a(n) = Sum_{d|n} mu(d)^2*tau(d)^2.A082476
a(n) = Sum_{d|n} mu(d)^2*tau(d)^2.
- Number of divisors d of n such that d+1 is also a divisor of n+1.A082477
Number of divisors d of n such that d+1 is also a divisor of n+1.
- Number of divisors d of n such that (d+1) is a divisor of (n+1) and (d+2) a divisor of (n+2).A082478
Number of divisors d of n such that (d+1) is a divisor of (n+1) and (d+2) a divisor of (n+2).
- a(1)=1, a(n)=a(floor(n/2))+a(floor(n/3)).A082479
a(1)=1, a(n)=a(floor(n/2))+a(floor(n/3)).
- a(n) = Product_{k=1..n} (F(k)+1) where F(k) denotes the k-th Fibonacci number.A082480
a(n) = Product_{k=1..n} (F(k)+1) where F(k) denotes the k-th Fibonacci number.
- Number of 1's in binary representation of C(2n,n).A082481
Number of 1's in binary representation of C(2n,n).
- a(n) = floor of (2^n-1)/n.A082482
a(n) = floor of (2^n-1)/n.
- Numbers k such that 1/(5-s(k)) is an integer where s(k) = Sum_{i=1..k} 1/2^floor(sqrt(i)).A082483
Numbers k such that 1/(5-s(k)) is an integer where s(k) = Sum_{i=1..k} 1/2^floor(sqrt(i)).
- First of four consecutive primes p, q, r, s such that neither of the congruences p^x+q^x = r (mod s) and q^x-p^x = r (mod s) has a solution.A082484
First of four consecutive primes p, q, r, s such that neither of the congruences p^x+q^x = r (mod s) and q^x-p^x = r (mod s) has a solution.
- Numbers k such that 1/(2-s(k)) is an integer where s(k) = Sum_{i=1..k} 1/3^floor(sqrt(i)).A082485
Numbers k such that 1/(2-s(k)) is an integer where s(k) = Sum_{i=1..k} 1/3^floor(sqrt(i)).
- Decimal expansion of the constant c satisfying Sum_{k>=1} 1/c^sqrtint(k) = 1 where sqrtint(k) = floor(sqrt(k)).A082486
Decimal expansion of the constant c satisfying Sum_{k>=1} 1/c^sqrtint(k) = 1 where sqrtint(k) = floor(sqrt(k)).
- Duplicate of A081798.A082487
Duplicate of A081798.
- a(n) = Sum_{k = 0..n} C(n,k) * C(n+k,k) * C(n+2*k,k) * C(n+3*k,k).A082488
a(n) = Sum_{k = 0..n} C(n,k) * C(n+k,k) * C(n+2*k,k) * C(n+3*k,k).
- a(n) = Sum_{k = 0..n} C(n,k) * C(n+k,k) * C(n+2*k,k) * C(n+3*k,k) * C(n+4*k,k).A082489
a(n) = Sum_{k = 0..n} C(n,k) * C(n+k,k) * C(n+2*k,k) * C(n+3*k,k) * C(n+4*k,k).
- Exponent of highest power of 3 dividing sum(0<=k<n, C(2n,n)).A082490
Exponent of highest power of 3 dividing sum(0<=k<n, C(2n,n)).
- a(n) = n! * d(n), where n! = factorial numbers (A000142), d(n) = subfactorial numbers (A000166).A082491
a(n) = n! * d(n), where n! = factorial numbers (A000142), d(n) = subfactorial numbers (A000166).
- Integer n expressed in bases from n, n-1, ..., 1.A082492
Integer n expressed in bases from n, n-1, ..., 1.
- a(n) = n*ceiling(2^n/n) - 2^n.A082493
a(n) = n*ceiling(2^n/n) - 2^n.
- a(n) = n - (2^n (mod n)).A082494
a(n) = n - (2^n (mod n)).
- a(n) = (2^n - 1) mod n.A082495
a(n) = (2^n - 1) mod n.
- Numbers of the form 2p+1, where p and p+2 are a pair of twin primes.A082496
Numbers of the form 2p+1, where p and p+2 are a pair of twin primes.
- a(0)=0, a(1)=1, a(2n)=2a(n), a(2n+1)=a(n)+a(n-1).A082497
a(0)=0, a(1)=1, a(2n)=2a(n), a(2n+1)=a(n)+a(n-1).
- a(0)=0, a(1)=1, a(2n)=a(n), a(2n+1)=a(n)+a(n-1).A082498
a(0)=0, a(1)=1, a(2n)=a(n), a(2n+1)=a(n)+a(n-1).
- Take a string of n x's and insert n-1 ^'s and n-2 pairs of parentheses in all possible legal ways. Sequence gives number of distinct values when x = sqrt(2).A082499
Take a string of n x's and insert n-1 ^'s and n-2 pairs of parentheses in all possible legal ways. Sequence gives number of distinct values when x = sqrt(2).
- a(n) = ceiling(n/2) if n is odd, or prime(n/2) otherwise.A082500
a(n) = ceiling(n/2) if n is odd, or prime(n/2) otherwise.
- Grundy numbers for start position in 1 X n closed Dots and Boxes.A082501
Grundy numbers for start position in 1 X n closed Dots and Boxes.
- Erroneous version of A052200.A082502
Erroneous version of A052200.
- Grundy numbers for start position of 1 X n triangular Dots and Boxes.A082503
Grundy numbers for start position of 1 X n triangular Dots and Boxes.
- Largest k such that the sum of sums of decimal digits of the next k numbers > n does not exceed 10.A082504
Largest k such that the sum of sums of decimal digits of the next k numbers > n does not exceed 10.
- a(n) = sum of (n-1)-th row terms of triangle A134059.A082505
a(n) = sum of (n-1)-th row terms of triangle A134059.
- a(n) = gcd(2^n, n - phi(n)); largest power of 2 dividing cototient(n) = A051953(n).A082506
a(n) = gcd(2^n, n - phi(n)); largest power of 2 dividing cototient(n) = A051953(n).
- Generated by a 3rd-order formal recursion with suitable initial values as follows: a(n) = n - a(n-1) - a(n-2) - a(n-3); a(0)=a(1)=a(2)=0.A082507
Generated by a 3rd-order formal recursion with suitable initial values as follows: a(n) = n - a(n-1) - a(n-2) - a(n-3); a(0)=a(1)=a(2)=0.
- Differences between consecutive primes that are powers of 2 in order of their appearance. Differences that are not powers of 2 are deleted from A001223.A082508
Differences between consecutive primes that are powers of 2 in order of their appearance. Differences that are not powers of 2 are deleted from A001223.
- Differences between consecutive primes that are not powers of 2 in order of their appearance. Differences which are powers of 2 are omitted from A001223.A082509
Differences between consecutive primes that are not powers of 2 in order of their appearance. Differences which are powers of 2 are omitted from A001223.
- Differences of consecutive primes being divisible by 6 in order of their appearance in A001223: terms not divisible by 6 are omitted from A001223.A082510
Differences of consecutive primes being divisible by 6 in order of their appearance in A001223: terms not divisible by 6 are omitted from A001223.