Sequences
392,541 sequences
- Number of perfect powers < n.A076411
Number of perfect powers < n.
- Number of n's in A076411.A076412
Number of n's in A076411.
- Number of ways n is expressible as the least common multiple of a nonempty set of positive integers not containing either 1 or n.A076413
Number of ways n is expressible as the least common multiple of a nonempty set of positive integers not containing either 1 or n.
- Decimal expansion of first solution of the equation cos(x)*cosh(x) = 1.A076414
Decimal expansion of first solution of the equation cos(x)*cosh(x) = 1.
- Decimal expansion of second solution of the equation cos(x)*cosh(x) = 1.A076415
Decimal expansion of second solution of the equation cos(x)*cosh(x) = 1.
- Decimal expansion of third solution of equation cos(x)*cosh(x) = 1.A076416
Decimal expansion of third solution of equation cos(x)*cosh(x) = 1.
- Decimal expansion of first solution of equation cos(x)*cosh(x) = -1.A076417
Decimal expansion of first solution of equation cos(x)*cosh(x) = -1.
- Decimal expansion of second solution of equation cos(x)*cosh(x) = -1.A076418
Decimal expansion of second solution of equation cos(x)*cosh(x) = -1.
- Decimal expansion of third solution of equation cos(x)*cosh(x) = -1.A076419
Decimal expansion of third solution of equation cos(x)*cosh(x) = -1.
- Decimal expansion of first solution of equation tan(x) = tanh(x).A076420
Decimal expansion of first solution of equation tan(x) = tanh(x).
- Decimal expansion of second solution to tan(x) = tanh(x).A076421
Decimal expansion of second solution to tan(x) = tanh(x).
- Decimal expansion of third solution of equation tan(x) = tanh(x).A076422
Decimal expansion of third solution of equation tan(x) = tanh(x).
- Number of iterations of the mapping k -> abs(reverse(lpd(k))-reverse(gpf(k))) to reach zero, or -1 if zero is never reached. lpd(k) is the largest proper divisor and gpf(k) is the greatest prime factor of k.A076423
Number of iterations of the mapping k -> abs(reverse(lpd(k))-reverse(gpf(k))) to reach zero, or -1 if zero is never reached. lpd(k) is the largest proper divisor and gpf(k) is the greatest prime factor of k.
- Smallest number that requires n steps to reach 0 when iterating the mapping k -> abs(reverse(lpd(k))-reverse(Lpf(k))). lpd(k) is the largest proper divisor and Lpf(k) is the largest prime factor of k.A076424
Smallest number that requires n steps to reach 0 when iterating the mapping k -> abs(reverse(lpd(k))-reverse(Lpf(k))). lpd(k) is the largest proper divisor and Lpf(k) is the largest prime factor of k.
- Numbers n such that zero is never reached by iterating the mapping k -> abs(reverse(lpd(k))-reverse(gpf(k))). lpd(k) is the largest proper divisor and gpf(k) is the largest prime factor of k.A076425
Numbers n such that zero is never reached by iterating the mapping k -> abs(reverse(lpd(k))-reverse(gpf(k))). lpd(k) is the largest proper divisor and gpf(k) is the largest prime factor of k.
- Fixed points of the mapping k -> abs(reverse(lpd(k))-reverse(Lpf(k))). lpd(k) is the largest proper divisor and Lpf(k) is the largest prime factor of k.A076426
Fixed points of the mapping k -> abs(reverse(lpd(k))-reverse(Lpf(k))). lpd(k) is the largest proper divisor and Lpf(k) is the largest prime factor of k.
- Number of solutions to Pillai's equation a^x - b^y = n, with a>0, b>0, x>1, y>1.A076427
Number of solutions to Pillai's equation a^x - b^y = n, with a>0, b>0, x>1, y>1.
- Numbers k such that the sum of digits of k in superfactorial base divides k.A076428
Numbers k such that the sum of digits of k in superfactorial base divides k.
- Sum of numbers that cannot be written as t*p(n) + u*p(n+1) for nonnegative integers t, u, where p(n) is the n-th prime.A076429
Sum of numbers that cannot be written as t*p(n) + u*p(n+1) for nonnegative integers t, u, where p(n) is the n-th prime.
- Sum of squares of numbers that cannot be written as t*p(n) + u*p(n+1) for nonnegative integers t,u, where p(n) is the n-th prime.A076430
Sum of squares of numbers that cannot be written as t*p(n) + u*p(n+1) for nonnegative integers t,u, where p(n) is the n-th prime.
- Perfect powers for which the two closest perfect powers are smaller.A076431
Perfect powers for which the two closest perfect powers are smaller.
- Perfect powers for which the three closest perfect powers are smaller.A076432
Perfect powers for which the three closest perfect powers are smaller.
- Perfect powers for which the two closest perfect powers are greater.A076433
Perfect powers for which the two closest perfect powers are greater.
- Number of weakly regular simple graphs on n nodes.A076434
Number of weakly regular simple graphs on n nodes.
- Number of strongly regular simple graphs on n nodes.A076435
Number of strongly regular simple graphs on n nodes.
- Square board sizes for which the lights-out problem has a unique solution (counting solutions differing only by rotation and reflection as distinct).A076436
Square board sizes for which the lights-out problem has a unique solution (counting solutions differing only by rotation and reflection as distinct).
- Square board sizes for which the lights out problem has a unique solution (counting solutions differing only by rotation and reflection as equivalent).A076437
Square board sizes for which the lights out problem has a unique solution (counting solutions differing only by rotation and reflection as equivalent).
- Numbers k which appear to have a unique representation as the difference of two perfect powers; that is, there is only one solution to Pillai's equation a^x - b^y = k, with a > 0, b > 0, x > 1, y > 1.A076438
Numbers k which appear to have a unique representation as the difference of two perfect powers; that is, there is only one solution to Pillai's equation a^x - b^y = k, with a > 0, b > 0, x > 1, y > 1.
- Numbers k which appear to have a unique representation as the difference of two perfect powers where those powers are both 2; that is, there is only one solution to Pillai's equation a^x - b^y = k, with a > 0, b > 0, x > 1, y > 1 and that solution has x = y = 2.A076439
Numbers k which appear to have a unique representation as the difference of two perfect powers where those powers are both 2; that is, there is only one solution to Pillai's equation a^x - b^y = k, with a > 0, b > 0, x > 1, y > 1 and that solution has x = y = 2.
- Numbers k which appear to have a unique representation as the difference of two perfect powers where one of those powers is odd; that is, there is only one solution to Pillai's equation a^x - b^y = k, with a > 0, b > 0, x > 1, y > 1 and that solution has odd x or odd y (or both odd).A076440
Numbers k which appear to have a unique representation as the difference of two perfect powers where one of those powers is odd; that is, there is only one solution to Pillai's equation a^x - b^y = k, with a > 0, b > 0, x > 1, y > 1 and that solution has odd x or odd y (or both odd).
- Let u(1) = u(2) = u(3) = 1; u(n) = sign(u(n-1)-u(n-2))*u(n-3), then a(n) = 1+u(n).A076441
Let u(1) = u(2) = u(3) = 1; u(n) = sign(u(n-1)-u(n-2))*u(n-3), then a(n) = 1+u(n).
- Odd-digit perfect powers.A076442
Odd-digit perfect powers.
- Even-digit palindromic perfect powers.A076443
Even-digit palindromic perfect powers.
- Smallest powerful number (definition 1) such that a(n)+n is also powerful.A076444
Smallest powerful number (definition 1) such that a(n)+n is also powerful.
- The smaller of a pair of powerful numbers (A001694) that differ by 2.A076445
The smaller of a pair of powerful numbers (A001694) that differ by 2.
- Differences of consecutive powerful numbers (definition 1).A076446
Differences of consecutive powerful numbers (definition 1).
- Let v(1)=v(2)=v(3)=1, v(n)=(-1)^n*sign(v(n-1)-v(n-2))*v(n-3), then a(n) =1+v(n).A076447
Let v(1)=v(2)=v(3)=1, v(n)=(-1)^n*sign(v(n-1)-v(n-2))*v(n-3), then a(n) =1+v(n).
- Numbers one more than a power of 2 which are the sum of n consecutive numbers one more than a power of 2.A076448
Numbers one more than a power of 2 which are the sum of n consecutive numbers one more than a power of 2.
- Least number whose digits can be used to form exactly n different primes (not necessarily using all digits).A076449
Least number whose digits can be used to form exactly n different primes (not necessarily using all digits).
- Natural sculptures.A076450
Natural sculptures.
- Let w(1)=w(2)=w(3)=1, w(n) = (-1)^floor(n/2)*sign(w(n-1)-w(n-2))*w(n-3), then a(n) = 1+w(n).A076451
Let w(1)=w(2)=w(3)=1, w(n) = (-1)^floor(n/2)*sign(w(n-1)-w(n-2))*w(n-3), then a(n) = 1+w(n).
- a(n+2) = abs(a(n+1)) - a(n), a(0)=0, a(1)=1.A076452
a(n+2) = abs(a(n+1)) - a(n), a(0)=0, a(1)=1.
- a(n+2) = abs(a(n+1)) - a(n), a(0)=1, a(1)=0.A076453
a(n+2) = abs(a(n+1)) - a(n), a(0)=1, a(1)=0.
- Sum of numbers that can be written as t*n + u*(n+1) for nonnegative integers t,u in exactly one way.A076454
Sum of numbers that can be written as t*n + u*(n+1) for nonnegative integers t,u in exactly one way.
- Sum of numbers that can be written as t*n + u*(n+1) for nonnegative integers t,u in exactly two ways.A076455
Sum of numbers that can be written as t*n + u*(n+1) for nonnegative integers t,u in exactly two ways.
- Sum of numbers that can be written as t*n + u*(n+1) for nonnegative integers t,u in exactly three ways.A076456
Sum of numbers that can be written as t*n + u*(n+1) for nonnegative integers t,u in exactly three ways.
- Sum of numbers that can be written as t*n + u*(n+1) for nonnegative integers t,u in exactly four ways.A076457
Sum of numbers that can be written as t*n + u*(n+1) for nonnegative integers t,u in exactly four ways.
- Sum of numbers that can be written as t*n + u*(n+1) for nonnegative integers t,u in exactly five ways.A076458
Sum of numbers that can be written as t*n + u*(n+1) for nonnegative integers t,u in exactly five ways.
- Sum of numbers that can be written as t*n + u*(n+1) for nonnegative integers t,u in exactly n ways.A076459
Sum of numbers that can be written as t*n + u*(n+1) for nonnegative integers t,u in exactly n ways.
- Sum of squares of numbers that can be written as t*n + u*(n+1) for nonnegative integers t,u in exactly one way.A076460
Sum of squares of numbers that can be written as t*n + u*(n+1) for nonnegative integers t,u in exactly one way.