Sequences
392,541 sequences
- Decimal expansion of 4*Product_{k>=0} (1 - 1/(2^k+1)).A085011
Decimal expansion of 4*Product_{k>=0} (1 - 1/(2^k+1)).
- For p = prime(n), a(n) is the smallest prime q such that pq is a base-2 pseudoprime; that is, 2^(pq-1) = 1 mod pq; a(n) is 0 if no such prime exists.A085012
For p = prime(n), a(n) is the smallest prime q such that pq is a base-2 pseudoprime; that is, 2^(pq-1) = 1 mod pq; a(n) is 0 if no such prime exists.
- a(1) = 1; for n>1, a(n) = smallest prime > a(n-1) such that a(1)*...*a(n) + 2 is a prime.A085013
a(1) = 1; for n>1, a(n) = smallest prime > a(n-1) such that a(1)*...*a(n) + 2 is a prime.
- For p = prime(n), a(n) is the number of primes q such that pq is a base-2 pseudoprime; that is, 2^(pq-1) = 1 mod pq.A085014
For p = prime(n), a(n) is the number of primes q such that pq is a base-2 pseudoprime; that is, 2^(pq-1) = 1 mod pq.
- Multiplicity of the root 1 in the characteristic polynomial mod 2 of the n X n matrix with entries binomial(i+j,i), 0<=i,j<n.A085015
Multiplicity of the root 1 in the characteristic polynomial mod 2 of the n X n matrix with entries binomial(i+j,i), 0<=i,j<n.
- Prime(n) concatenated with Reverse(Prime(n)) (a palindrome) is divisible by n.A085016
Prime(n) concatenated with Reverse(Prime(n)) (a palindrome) is divisible by n.
- Reverse(Prime(n)) concatenated with Prime(n) (a palindrome) is divisible by n.A085017
Reverse(Prime(n)) concatenated with Prime(n) (a palindrome) is divisible by n.
- Numbers n such that there is no divisor m of n with m<n and A083752(n) = (n/m)A083752(m).A085018
Numbers n such that there is no divisor m of n with m<n and A083752(n) = (n/m)A083752(m).
- a(n) = A083752(A085018(n)).A085019
a(n) = A083752(A085018(n)).
- a(n) = Sum_{d|n, (d+1) prime} (d + 1).A085020
a(n) = Sum_{d|n, (d+1) prime} (d + 1).
- Number of prime factors of cyclotomic(n,2), which is A019320(n), the value of the n-th cyclotomic polynomial evaluated at x=2.A085021
Number of prime factors of cyclotomic(n,2), which is A019320(n), the value of the n-th cyclotomic polynomial evaluated at x=2.
- Integer floor of coefficients of exp(x*A(x)).A085022
Integer floor of coefficients of exp(x*A(x)).
- E.g.f. satisfies exp(x*sum(n>=0, floor(a(n)/n!)*x^n)) = sum(n>=0, a(n)*x^n/n!).A085023
E.g.f. satisfies exp(x*sum(n>=0, floor(a(n)/n!)*x^n)) = sum(n>=0, a(n)*x^n/n!).
- Duplicate of A085001.A085024
Duplicate of A085001.
- a(n) = (5*n+1)*(5*n+6).A085025
a(n) = (5*n+1)*(5*n+6).
- a(n) = (6*n+1)*(6*n+7).A085026
a(n) = (6*n+1)*(6*n+7).
- a(n) = (4*n+3)*(4*n+7).A085027
a(n) = (4*n+3)*(4*n+7).
- Number of prime factors of cyclotomic(n,3), which is A019321(n), the value of the n-th cyclotomic polynomial evaluated at x=3.A085028
Number of prime factors of cyclotomic(n,3), which is A019321(n), the value of the n-th cyclotomic polynomial evaluated at x=3.
- Number of prime factors of cyclotomic(n,4), which is A019322(n), the value of the n-th cyclotomic polynomial evaluated at x=4.A085029
Number of prime factors of cyclotomic(n,4), which is A019322(n), the value of the n-th cyclotomic polynomial evaluated at x=4.
- Number of prime factors of cyclotomic(n,5), which is A019323(n), the value of the n-th cyclotomic polynomial evaluated at x=5.A085030
Number of prime factors of cyclotomic(n,5), which is A019323(n), the value of the n-th cyclotomic polynomial evaluated at x=5.
- Number of prime factors of cyclotomic(n,6), which is A019324(n), the value of the n-th cyclotomic polynomial evaluated at x=6.A085031
Number of prime factors of cyclotomic(n,6), which is A019324(n), the value of the n-th cyclotomic polynomial evaluated at x=6.
- Number of prime factors of cyclotomic(n,7), which is A019325(n), the value of the n-th cyclotomic polynomial evaluated at x=7.A085032
Number of prime factors of cyclotomic(n,7), which is A019325(n), the value of the n-th cyclotomic polynomial evaluated at x=7.
- Number of prime factors of cyclotomic(n,8), which is A019326(n), the value of the n-th cyclotomic polynomial evaluated at x=8.A085033
Number of prime factors of cyclotomic(n,8), which is A019326(n), the value of the n-th cyclotomic polynomial evaluated at x=8.
- Number of prime factors of cyclotomic(n,9), which is A019327(n), the value of the n-th cyclotomic polynomial evaluated at x=9.A085034
Number of prime factors of cyclotomic(n,9), which is A019327(n), the value of the n-th cyclotomic polynomial evaluated at x=9.
- Number of prime factors of cyclotomic(n,10), which is A019328(n), the value of the n-th cyclotomic polynomial evaluated at x=10.A085035
Number of prime factors of cyclotomic(n,10), which is A019328(n), the value of the n-th cyclotomic polynomial evaluated at x=10.
- a(n) = (5*n+2)*(5*n+7).A085036
a(n) = (5*n+2)*(5*n+7).
- Smallest square divisible by the n-th triangular number (n(n+1)/2).A085037
Smallest square divisible by the n-th triangular number (n(n+1)/2).
- Erroneous version of A063934.A085038
Erroneous version of A063934.
- Smallest multiple of the n-th prime such that every partial sum is a square.A085039
Smallest multiple of the n-th prime such that every partial sum is a square.
- Squares arising in A085039. n-th partial sum of A085039.A085040
Squares arising in A085039. n-th partial sum of A085039.
- a(1) = 2, a(n+1) = smallest prime of the form a(n) + k*prime(n+1), k >1.A085041
a(1) = 2, a(n+1) = smallest prime of the form a(n) + k*prime(n+1), k >1.
- Smallest multiple of the n-th prime such that every partial sum is a prime, or 0 if no such number exists.A085042
Smallest multiple of the n-th prime such that every partial sum is a prime, or 0 if no such number exists.
- Primes arising in A085042: a(n) = the n-th partial sum of A085042.A085043
Primes arising in A085042: a(n) = the n-th partial sum of A085042.
- Smallest number k such that tau(n) +tau(k) =tau(n+k), or 0 if no such number exists.A085044
Smallest number k such that tau(n) +tau(k) =tau(n+k), or 0 if no such number exists.
- Smallest k such that tau(n + k) = tau (nk), or 0 if no such number exists, where tau = A000005.A085045
Smallest k such that tau(n + k) = tau (nk), or 0 if no such number exists, where tau = A000005.
- a(n) = n^2 - (1 + (-1)^n)/2.A085046
a(n) = n^2 - (1 + (-1)^n)/2.
- a(n) is the least number not already used such that the arithmetic mean of the first n terms is a square.A085047
a(n) is the least number not already used such that the arithmetic mean of the first n terms is a square.
- a(2n-1) is odd, a(2n) = even, such that the difference of two terms with different parity is a prime.A085048
a(2n-1) is odd, a(2n) = even, such that the difference of two terms with different parity is a prime.
- a(1) = 1, then the next n numbers are prime if n is composite, else are composite if n is a prime.A085049
a(1) = 1, then the next n numbers are prime if n is composite, else are composite if n is a prime.
- Smallest multiple of n sandwiched between two squarefree numbers.A085050
Smallest multiple of n sandwiched between two squarefree numbers.
- Smallest multiple of n sandwiched between two numbers both having square divisors.A085051
Smallest multiple of n sandwiched between two numbers both having square divisors.
- Start with n and continue adding primes until one reaches a prime > n. Or, sequence gives n + P(k) where P(k)=sum_{k=1..n} prime(k) and k is the least value such that n + P(k) is prime and > n.A085052
Start with n and continue adding primes until one reaches a prime > n. Or, sequence gives n + P(k) where P(k)=sum_{k=1..n} prime(k) and k is the least value such that n + P(k) is prime and > n.
- Number of primes of the form nk+1, where k=1 to n; 0 if no such number exists.A085053
Number of primes of the form nk+1, where k=1 to n; 0 if no such number exists.
- Smallest palindromic prime containing the n-th palindrome.A085054
Smallest palindromic prime containing the n-th palindrome.
- Duplicate of A075070.A085055
Duplicate of A075070.
- (Product of all composite numbers from 1 to n)/ ( product of the prime divisors of all composite numbers up to n). More precisely, denominator = product of the largest squarefree divisors of composite numbers up to n.A085056
(Product of all composite numbers from 1 to n)/ ( product of the prime divisors of all composite numbers up to n). More precisely, denominator = product of the largest squarefree divisors of composite numbers up to n.
- a(n) is the smallest integer of the form a*b*c.../p*q*r..., where the numerator and the denominator contain n numbers each and a,b,c,...p,q,r... are all the integers from 1 to 2n.A085057
a(n) is the smallest integer of the form a*b*c.../p*q*r..., where the numerator and the denominator contain n numbers each and a,b,c,...p,q,r... are all the integers from 1 to 2n.
- a(n) = A001511(n+1) + 1.A085058
a(n) = A001511(n+1) + 1.
- a(1) = 1, a(n+1) = a(n)-n if a(n) > n else a(n+1) = a(n) + n.A085059
a(1) = 1, a(n+1) = a(n)-n if a(n) > n else a(n+1) = a(n) + n.
- Integer reached in A085058.A085060
Integer reached in A085058.