Sequences
392,541 sequences
- Numbers n such that there are at least 3 integers k from the set {2,3,4,5,6,7,8,9} such that the digital sum of each base k representation of n equals k.A075761
Numbers n such that there are at least 3 integers k from the set {2,3,4,5,6,7,8,9} such that the digital sum of each base k representation of n equals k.
- A001003(p-1)/p where p runs through the odd primes.A075762
A001003(p-1)/p where p runs through the odd primes.
- Numbers k that divide A001003(k-1).A075763
Numbers k that divide A001003(k-1).
- Schroeder pseudoprimes: Composites k that divide the k-th Schroeder number A001003(k-1).A075764
Schroeder pseudoprimes: Composites k that divide the k-th Schroeder number A001003(k-1).
- a(n) = floor(prime(n)/n) + (prime(n) mod n).A075765
a(n) = floor(prime(n)/n) + (prime(n) mod n).
- Numbers k such that A007923(k) is prime.A075766
Numbers k such that A007923(k) is prime.
- Least m such that A(m) = -10^n, where A(n) = sigma(n) - 2n, the abundance of n.A075767
Least m such that A(m) = -10^n, where A(n) = sigma(n) - 2n, the abundance of n.
- A Wallis pair (x,y) satisfies sigma(x^2) = sigma(y^2); sequence gives x's for indecomposable Wallis pairs with x < y (ordered by values of x).A075768
A Wallis pair (x,y) satisfies sigma(x^2) = sigma(y^2); sequence gives x's for indecomposable Wallis pairs with x < y (ordered by values of x).
- A Wallis pair (x,y) satisfies sigma(x^2) = sigma(y^2); sequence gives y's for indecomposable Wallis pairs with x < y (ordered by values of x).A075769
A Wallis pair (x,y) satisfies sigma(x^2) = sigma(y^2); sequence gives y's for indecomposable Wallis pairs with x < y (ordered by values of x).
- Let u(1)=u(2)=u(3)=1, u(n+3)=(n*u(n)+(n+1)*u(n+1)+(n+2)*u(n+2))/(n+3); sequence gives values of n such that u(n) is an integer.A075770
Let u(1)=u(2)=u(3)=1, u(n+3)=(n*u(n)+(n+1)*u(n+1)+(n+2)*u(n+2))/(n+3); sequence gives values of n such that u(n) is an integer.
- Let n^2 = q*prime(n) + r with 0 <= r < prime(n); then a(n) = q + r.A075771
Let n^2 = q*prime(n) + r with 0 <= r < prime(n); then a(n) = q + r.
- Difference between the n-th perfect power and the closest perfect power.A075772
Difference between the n-th perfect power and the closest perfect power.
- Let {b(n)} be the sequence of perfect powers (A001597); then a(n) = max { b(n)-b(n-1), b(n+1)-b(n) }.A075773
Let {b(n)} be the sequence of perfect powers (A001597); then a(n) = max { b(n)-b(n-1), b(n+1)-b(n) }.
- Number of syllables in n in American English.A075774
Number of syllables in n in American English.
- Numbers k that divide phi(Fibonacci(k)).A075775
Numbers k that divide phi(Fibonacci(k)).
- Numbers k that do not divide phi(Fibonacci(k)).A075776
Numbers k that do not divide phi(Fibonacci(k)).
- Minimal surface area of a rectangular solid with volume n and integer sides.A075777
Minimal surface area of a rectangular solid with volume n and integer sides.
- Decimal expansion of the real root of x^3 + x^2 - 1.A075778
Decimal expansion of the real root of x^3 + x^2 - 1.
- Triangle T(n,k) = f(n,k,n-1), n >= 2, 1 <= k <= n-1, where f is given below.A075779
Triangle T(n,k) = f(n,k,n-1), n >= 2, 1 <= k <= n-1, where f is given below.
- Triangle T(n,k) = f(n,k,n-2), n >= 2, 1 <= k <= n-1, where f is given below.A075780
Triangle T(n,k) = f(n,k,n-2), n >= 2, 1 <= k <= n-1, where f is given below.
- Primes of the form perfect_power(n)+n.A075781
Primes of the form perfect_power(n)+n.
- Numbers n such that perfect_power(n)+perfect_power(n+1) is prime.A075782
Numbers n such that perfect_power(n)+perfect_power(n+1) is prime.
- Additive perfect powers: sum-of-digits is also a perfect power.A075783
Additive perfect powers: sum-of-digits is also a perfect power.
- Numbers n such that sopf(n) = sopf(n-1) + sopf(n-2) + sopf(n-3), where sopf(x) = sum of the distinct prime factors of x.A075784
Numbers n such that sopf(n) = sopf(n-1) + sopf(n-2) + sopf(n-3), where sopf(x) = sum of the distinct prime factors of x.
- Number of ways to express 3/n as Egyptian fractions in just three terms.A075785
Number of ways to express 3/n as Egyptian fractions in just three terms.
- Palindromic perfect powers.A075786
Palindromic perfect powers.
- Even-digit perfect powers.A075787
Even-digit perfect powers.
- If n can be written in the form r^i-s^j (see A074981), where r,s,i,j are integers with r>0, s>0, i>1, j>1 choose the representation with smallest r^i (in case of ties, minimize i and j); or if n is not of this form set r=s=i=j=0; sequence gives values of r.A075788
If n can be written in the form r^i-s^j (see A074981), where r,s,i,j are integers with r>0, s>0, i>1, j>1 choose the representation with smallest r^i (in case of ties, minimize i and j); or if n is not of this form set r=s=i=j=0; sequence gives values of r.
- Value of i, when n is written as r^i - s^j with the smallest possible r^i (with minimal i) and r, s > 0, i, j > 1; or 0 if n is not of this form.A075789
Value of i, when n is written as r^i - s^j with the smallest possible r^i (with minimal i) and r, s > 0, i, j > 1; or 0 if n is not of this form.
- If n can be written in the form r^i-s^j (see A074981), where r,s,i,j are integers with r>0, s>0, i>1, j>1 choose the representation with smallest r^i (in case of ties, minimize i and j); or if n is not of this form set r=s=i=j=0; sequence gives values of s.A075790
If n can be written in the form r^i-s^j (see A074981), where r,s,i,j are integers with r>0, s>0, i>1, j>1 choose the representation with smallest r^i (in case of ties, minimize i and j); or if n is not of this form set r=s=i=j=0; sequence gives values of s.
- If n can be written in the form r^i-s^j (see A074981), where r,s,i,j are integers with r>0, s>0, i>1, j>1 choose the representation with smallest r^i (in case of ties, minimize i and j); or if n is not of this form set r=s=i=j=0; sequence gives values of j.A075791
If n can be written in the form r^i-s^j (see A074981), where r,s,i,j are integers with r>0, s>0, i>1, j>1 choose the representation with smallest r^i (in case of ties, minimize i and j); or if n is not of this form set r=s=i=j=0; sequence gives values of j.
- E.g.f.: 1 + log(1+f(x)) where f(x) = log(1/(2-exp(x))) = e.g.f. for A000629.A075792
E.g.f.: 1 + log(1+f(x)) where f(x) = log(1/(2-exp(x))) = e.g.f. for A000629.
- Primes p such that f_p(x)=(1296+432*x+108*x^2+24*x^3+5*x^4+x^5) mod p factors as product of 3 linear and one irreducible quadratic factor.A075793
Primes p such that f_p(x)=(1296+432*x+108*x^2+24*x^3+5*x^4+x^5) mod p factors as product of 3 linear and one irreducible quadratic factor.
- a(n) = the least positive integer k such that phi(k) > phi(1) + ... + phi(n).A075794
a(n) = the least positive integer k such that phi(k) > phi(1) + ... + phi(n).
- Number of k, 0<k<=n, such that the resultant of the k-th cyclotomic polynomial and the n-th cyclotomic polynomial is equal to 1.A075795
Number of k, 0<k<=n, such that the resultant of the k-th cyclotomic polynomial and the n-th cyclotomic polynomial is equal to 1.
- Numbers k such that 5*k^2 + 5 is a square.A075796
Numbers k such that 5*k^2 + 5 is a square.
- Number of n-digit perfect powers with distinct digits.A075797
Number of n-digit perfect powers with distinct digits.
- Triangle T(n,k) = f(n,k,n-1), n >= 0, 0 <= k <= n, where f is given below.A075798
Triangle T(n,k) = f(n,k,n-1), n >= 0, 0 <= k <= n, where f is given below.
- Palindromic numbers which are products of an even number of distinct primes.A075799
Palindromic numbers which are products of an even number of distinct primes.
- Palindromic numbers which are products of an odd number of distinct primes.A075800
Palindromic numbers which are products of an odd number of distinct primes.
- Differences between adjacent palindromic nonprime numbers A032350.A075801
Differences between adjacent palindromic nonprime numbers A032350.
- Characteristic function of perfect powers, A001597.A075802
Characteristic function of perfect powers, A001597.
- Differences between adjacent palindromic squarefree numbers.A075803
Differences between adjacent palindromic squarefree numbers.
- Differences between adjacent palindromic nonsquarefree numbers A035132.A075804
Differences between adjacent palindromic nonsquarefree numbers A035132.
- Differences between adjacent palindromic numbers which are products of an even number of distinct primes.A075805
Differences between adjacent palindromic numbers which are products of an even number of distinct primes.
- Differences between adjacent palindromic numbers which are products of an odd number of distinct primes.A075806
Differences between adjacent palindromic numbers which are products of an odd number of distinct primes.
- Numbers n such that n-th prime is palindromic.A075807
Numbers n such that n-th prime is palindromic.
- Palindromic odd composite numbers that are the products of an odd number of distinct primes.A075808
Palindromic odd composite numbers that are the products of an odd number of distinct primes.
- Palindromic even numbers with an odd number of distinct prime factors.A075809
Palindromic even numbers with an odd number of distinct prime factors.
- Palindromic odd squarefree numbers with an even number of distinct prime factors.A075810
Palindromic odd squarefree numbers with an even number of distinct prime factors.