Sequences
392,541 sequences
- Palindromic primes with prime middle digit.A076611
Palindromic primes with prime middle digit.
- Palindromic numbers with nonprime middle digit.A076612
Palindromic numbers with nonprime middle digit.
- Palindromic primes with nonprime middle digit.A076613
Palindromic primes with nonprime middle digit.
- Numbers of the form 2^k + 3^k + ... + p_n^k.A076614
Numbers of the form 2^k + 3^k + ... + p_n^k.
- Number of permutations of {1,2,...,n} that result in a binary search tree with the minimum possible height.A076615
Number of permutations of {1,2,...,n} that result in a binary search tree with the minimum possible height.
- Number of permutations of {1,2,...,n} that result in a binary search tree (when elements of the permutation are inserted in that order) of height n-1 (i.e., the second largest possible height).A076616
Number of permutations of {1,2,...,n} that result in a binary search tree (when elements of the permutation are inserted in that order) of height n-1 (i.e., the second largest possible height).
- Numbers k such that sum of the divisors d of k divides 1 + 2 + ... + k = k(k+1)/2.A076617
Numbers k such that sum of the divisors d of k divides 1 + 2 + ... + k = k(k+1)/2.
- Least x>1 such that x^d == 1 (mod d) for each divisor d of n.A076618
Least x>1 such that x^d == 1 (mod d) for each divisor d of n.
- Least x>1 such that x^d == 1 (mod d) for each divisor d of n, for all nonsquarefree numbers n (cf. A013929).A076619
Least x>1 such that x^d == 1 (mod d) for each divisor d of n, for all nonsquarefree numbers n (cf. A013929).
- Coefficient of x^a(n) in (x+1)*(x+2)*...*(x+n) is the largest one.A076620
Coefficient of x^a(n) in (x+1)*(x+2)*...*(x+n) is the largest one.
- Least square greater than the product of two successive primes.A076621
Least square greater than the product of two successive primes.
- Coefficient of x^a(n) in (x-1)*(x-2)*...*(x-n) is the largest one (not in absolute value).A076622
Coefficient of x^a(n) in (x-1)*(x-2)*...*(x-n) is the largest one (not in absolute value).
- Total number of left truncatable primes (without zeros) in base n.A076623
Total number of left truncatable primes (without zeros) in base n.
- Numbers k such that the sum of the non-divisors of k between 1 and k is a perfect square.A076624
Numbers k such that the sum of the non-divisors of k between 1 and k is a perfect square.
- Maximum of the absolute values of the coefficients of P(n,x) where P(n,x) = 4^(n-1)*Product_{k=0..n} (x - cos(k*Pi/n)^2).A076625
Maximum of the absolute values of the coefficients of P(n,x) where P(n,x) = 4^(n-1)*Product_{k=0..n} (x - cos(k*Pi/n)^2).
- Array of coefficients of polynomials p(n,x) = 2^(n-1)*Product_{i=0..n} (x - cos(i*Pi/n)) of degree (n+1) with P(-1,x) = 1, P(0,x) = 0.A076626
Array of coefficients of polynomials p(n,x) = 2^(n-1)*Product_{i=0..n} (x - cos(i*Pi/n)) of degree (n+1) with P(-1,x) = 1, P(0,x) = 0.
- a(n) = tau(n)*(n-tau(n)), where tau(n) = number of divisors of n (A000005).A076627
a(n) = tau(n)*(n-tau(n)), where tau(n) = number of divisors of n (A000005).
- a(n) = 2^(2^(n-1))*b(n) where b(1) = 1/2 and b(n+1) = b(n) - b(n)^2.A076628
a(n) = 2^(2^(n-1))*b(n) where b(1) = 1/2 and b(n+1) = b(n) - b(n)^2.
- Duplicate of A067816.A076629
Duplicate of A067816.
- a(n) is the smallest number such that product of first n terms is strictly greater than n-th power of a(n-1) starting with a(1)=1.A076630
a(n) is the smallest number such that product of first n terms is strictly greater than n-th power of a(n-1) starting with a(1)=1.
- Solve 2^n - 2 = 7(x^2 - x) + (y^2 - y) for (x,y) with x>0, y>0; a(n) = value of y.A076631
Solve 2^n - 2 = 7(x^2 - x) + (y^2 - y) for (x,y) with x>0, y>0; a(n) = value of y.
- Solve 2^n - 2 = 7(x^2 - x) + (y^2 - y) for (x,y) with x>0, y>0; sequence gives value of x.A076632
Solve 2^n - 2 = 7(x^2 - x) + (y^2 - y) for (x,y) with x>0, y>0; sequence gives value of x.
- Incorrect guess for index of n-th local maxima (in decreasing order) of f(k) = (sigma(k) - H_k)/(exp(H_k)log(H_k)), where H_k = 1 + 1/2 + 1/3 + ... + 1/k.A076633
Incorrect guess for index of n-th local maxima (in decreasing order) of f(k) = (sigma(k) - H_k)/(exp(H_k)log(H_k)), where H_k = 1 + 1/2 + 1/3 + ... + 1/k.
- Coefficient of x^a(n) in (x+1/2)*(x+2/2)*...*(x+n/2) is the largest one.A076634
Coefficient of x^a(n) in (x+1/2)*(x+2/2)*...*(x+n/2) is the largest one.
- Let b(1)=1/n, b(2)=1, b(k+1)=abs(b(k))-b(k-1)^2; then b(k) is >0 for k>a(n).A076635
Let b(1)=1/n, b(2)=1, b(k+1)=abs(b(k))-b(k-1)^2; then b(k) is >0 for k>a(n).
- a(1) = 1, a(2n) = smallest prime > (2n-1)-th partial sum of the sequence itself and a(2n+1) = smallest composite number > 2n-th partial sum of the sequence.A076636
a(1) = 1, a(2n) = smallest prime > (2n-1)-th partial sum of the sequence itself and a(2n+1) = smallest composite number > 2n-th partial sum of the sequence.
- Numerators of harmonic numbers when these numerators are divisible by squares of primes >= 5 in the case of Wolstenholme's Theorem.A076637
Numerators of harmonic numbers when these numerators are divisible by squares of primes >= 5 in the case of Wolstenholme's Theorem.
- Denominators of harmonic numbers when the numerators are divisible by squares of primes >= 5 in the case of Wolstenholme's Theorem.A076638
Denominators of harmonic numbers when the numerators are divisible by squares of primes >= 5 in the case of Wolstenholme's Theorem.
- Numbers that are neither primes nor interprimes.A076639
Numbers that are neither primes nor interprimes.
- a(1)=1, a(n) = a(n-phi(n)) + 1.A076640
a(1)=1, a(n) = a(n-phi(n)) + 1.
- Integers read backwards, but with repetitions omitted.A076641
Integers read backwards, but with repetitions omitted.
- Coefficient of x^a(n) in (x+1/3!)*(x+2/3!)*...*(x+n/3!) is the largest one.A076642
Coefficient of x^a(n) in (x+1/3!)*(x+2/3!)*...*(x+n/3!) is the largest one.
- Positive integers read backwards, but omit a number if it is <= an earlier number.A076643
Positive integers read backwards, but omit a number if it is <= an earlier number.
- a(1)=1; for n>1, a(n) = a(n-floor(sqrt(n))) + n.A076644
a(1)=1; for n>1, a(n) = a(n-floor(sqrt(n))) + n.
- Irregular triangle read by rows of ways to write 0 as 1 +- 2 +- 3 +- 4 +- ... +- k for some k, where signs alternate except that there is one instance of two consecutive positive terms.A076645
Irregular triangle read by rows of ways to write 0 as 1 +- 2 +- 3 +- 4 +- ... +- k for some k, where signs alternate except that there is one instance of two consecutive positive terms.
- Numbers n such that sigma(n) * antisigma(n) is a perfect square, where antisigma(n) = sum of the non-divisors of n that are between 1 and n.A076646
Numbers n such that sigma(n) * antisigma(n) is a perfect square, where antisigma(n) = sum of the non-divisors of n that are between 1 and n.
- Numbers n such that phi(n) + phi(n+1) = sigma(n)/2.A076647
Numbers n such that phi(n) + phi(n+1) = sigma(n)/2.
- Numbers k such that phi(k-1) + phi(k+1) = sigma(k)/2.A076648
Numbers k such that phi(k-1) + phi(k+1) = sigma(k)/2.
- Number of digits required to write the prime factors of n.A076649
Number of digits required to write the prime factors of n.
- m-morphic numbers for any m equal to 26 (mod 50).A076650
m-morphic numbers for any m equal to 26 (mod 50).
- a(n) = floor( sqrt( p * (p+2) / 2)) where p is the lesser of the twin primes.A076651
a(n) = floor( sqrt( p * (p+2) / 2)) where p is the lesser of the twin primes.
- Smallest composite number not divisible by 10, not occurring earlier and starting with the end of the previous term.A076652
Smallest composite number not divisible by 10, not occurring earlier and starting with the end of the previous term.
- Smallest prime number not occurring earlier and starting with the final digit of the previous term.A076653
Smallest prime number not occurring earlier and starting with the final digit of the previous term.
- Smallest natural number not a multiple of 10, not occurring earlier and starting with the end of the previous term.A076654
Smallest natural number not a multiple of 10, not occurring earlier and starting with the end of the previous term.
- a(n) = numberator(b(n)) where b(1)=1, b(2)=2 and for n > 2, b(n) = 1/b(n-2) - 1/b(n-1).A076655
a(n) = numberator(b(n)) where b(1)=1, b(2)=2 and for n > 2, b(n) = 1/b(n-2) - 1/b(n-1).
- a(1) = 2; a(n) is smallest prime > 3*a(n-1).A076656
a(1) = 2; a(n) is smallest prime > 3*a(n-1).
- a(n) = (1/24) * binomial(2n,n)*(16^n-binomial(2n,n)^2). Right side of identity involving series A005148.A076657
a(n) = (1/24) * binomial(2n,n)*(16^n-binomial(2n,n)^2). Right side of identity involving series A005148.
- Numerator of f(n), where for n > 2, f(n) = (n-1)/f(n-1) + (n-2)/f(n-2), with f(1)=1, f(2)=2.A076658
Numerator of f(n), where for n > 2, f(n) = (n-1)/f(n-1) + (n-2)/f(n-2), with f(1)=1, f(2)=2.
- Denominator of f(n), where for n>2, f(n) = (n-1)/f(n-1)+(n-2)/f(n-2), with f(1) = 1, f(2) = 2.A076659
Denominator of f(n), where for n>2, f(n) = (n-1)/f(n-1)+(n-2)/f(n-2), with f(1) = 1, f(2) = 2.
- Numbers m such that A076644(m) = floor((2/3)*m*(sqrt(m)+1)).A076660
Numbers m such that A076644(m) = floor((2/3)*m*(sqrt(m)+1)).