Sequences
392,541 sequences
- Satisfies f(x*f(x)) = exp(x), where f(x)=sum(n=0,infinity, a(n)*x^n/n!).A087961
Satisfies f(x*f(x)) = exp(x), where f(x)=sum(n=0,infinity, a(n)*x^n/n!).
- Satisfies Sum_{n>=0} a(n)*x^n/n! = log(f(x)) = series reversion of x*f(x), where f(x*f(x)) = exp(x) and f(x) = Sum_{n>=0} A087961(n)*x^n/n!.A087962
Satisfies Sum_{n>=0} a(n)*x^n/n! = log(f(x)) = series reversion of x*f(x), where f(x*f(x)) = exp(x) and f(x) = Sum_{n>=0} A087961(n)*x^n/n!.
- Exponent of highest power of 2 dividing 3*prime(n)+1.A087963
Exponent of highest power of 2 dividing 3*prime(n)+1.
- a(n) is the least prime p such that exponent of highest power of 2 dividing 3p+1 equals n.A087964
a(n) is the least prime p such that exponent of highest power of 2 dividing 3p+1 equals n.
- Numbers k such that 2^k - 1 is divisible by (k-1).A087965
Numbers k such that 2^k - 1 is divisible by (k-1).
- a(n) = gcd(-1 + 2^n, n^2).A087966
a(n) = gcd(-1 + 2^n, n^2).
- Integers m such that gcd(2^m-1, m^2) is not a square number.A087967
Integers m such that gcd(2^m-1, m^2) is not a square number.
- a(n) = gcd(1 + 2^n, n^2).A087968
a(n) = gcd(1 + 2^n, n^2).
- Integers m such that gcd(2^m+1, m^2) is not a square.A087969
Integers m such that gcd(2^m+1, m^2) is not a square.
- Maximal term in Collatz-iteration started at 2^n+1.A087970
Maximal term in Collatz-iteration started at 2^n+1.
- Maximal term in Collatz-iteration started at 3^n-1.A087971
Maximal term in Collatz-iteration started at 3^n-1.
- Maximal term in Collatz-iteration started at 3^n+1.A087972
Maximal term in Collatz-iteration started at 3^n+1.
- Maximal term in Collatz-iteration started at 3^n.A087973
Maximal term in Collatz-iteration started at 3^n.
- Largest value of number of distinct prime factors arising in the 3x+1 iteration trajectory started with n.A087974
Largest value of number of distinct prime factors arising in the 3x+1 iteration trajectory started with n.
- a(n) is the smallest number having n as the largest number of distinct prime factors of any term in its 3x+1 trajectory.A087975
a(n) is the smallest number having n as the largest number of distinct prime factors of any term in its 3x+1 trajectory.
- a(n) = A001221(A025586(n)), the number of distinct prime-factors of maximal term in 3x+1 iteration list started at n.A087976
a(n) = A001221(A025586(n)), the number of distinct prime-factors of maximal term in 3x+1 iteration list started at n.
- a(n) is the first term in the first chain of at least n consecutive numbers each having exactly four distinct prime factors.A087977
a(n) is the first term in the first chain of at least n consecutive numbers each having exactly four distinct prime factors.
- a(n) is the first term in a chain of at least n consecutive numbers, each having exactly m = 5 distinct prime factors.A087978
a(n) is the first term in a chain of at least n consecutive numbers, each having exactly m = 5 distinct prime factors.
- a(n) = Min {x : sigma(x) = phi(n*x), x is not a prime}, least nonprime solutions to sigma(x) = phi(n*x).A087979
a(n) = Min {x : sigma(x) = phi(n*x), x is not a prime}, least nonprime solutions to sigma(x) = phi(n*x).
- Numbers with strictly decreasing prime exponents.A087980
Numbers with strictly decreasing prime exponents.
- E.g.f.: exp(-2*x) / (1-x)^2.A087981
E.g.f.: exp(-2*x) / (1-x)^2.
- Maximal permanent of a nonsingular n X n (+1,-1)-matrix.A087982
Maximal permanent of a nonsingular n X n (+1,-1)-matrix.
- Number of different values taken by the permanent of n X n (0,1)-matrices.A087983
Number of different values taken by the permanent of n X n (0,1)-matrices.
- 9-ish numbers (A011539) which are not lunar primes (A087097).A087984
9-ish numbers (A011539) which are not lunar primes (A087097).
- a(n) = prime(x) is the smallest prime such that 1+n*prime(x) is divisible by prime(x+1), or 0 if no such prime exists.A087985
a(n) = prime(x) is the smallest prime such that 1+n*prime(x) is divisible by prime(x+1), or 0 if no such prime exists.
- a(n) is the smallest prime p such that 1 + 2^n*p is divisible by the following prime, or 0 if no such prime exists.A087986
a(n) is the smallest prime p such that 1 + 2^n*p is divisible by the following prime, or 0 if no such prime exists.
- a(n) is the Mertens function value at the n-th primorial number.A087987
a(n) is the Mertens function value at the n-th primorial number.
- Palindromic numbers whose squares and cubes are equally palindromic.A087988
Palindromic numbers whose squares and cubes are equally palindromic.
- a(n) = M(n!), the value of Mertens's function at the n-th factorial.A087989
a(n) = M(n!), the value of Mertens's function at the n-th factorial.
- Number of palindromic divisors of n.A087990
Number of palindromic divisors of n.
- Number of non-palindromic divisors of n.A087991
Number of non-palindromic divisors of n.
- Duplicate of A062687.A087992
Duplicate of A062687.
- Numbers k for which the quotient q(k)=(k+rev(k))/abs(k-rev(k)) is an integer.A087993
Numbers k for which the quotient q(k)=(k+rev(k))/abs(k-rev(k)) is an integer.
- Integer values of quotients arising in A087993. The quotient is (n+rev(n))/abs(n-rev(n)).A087994
Integer values of quotients arising in A087993. The quotient is (n+rev(n))/abs(n-rev(n)).
- Base-10 palindromes that cannot be formed by performing reverse-and-add operations on any previous nonpalindromic positive integers.A087995
Base-10 palindromes that cannot be formed by performing reverse-and-add operations on any previous nonpalindromic positive integers.
- Residues when (n+rev[n]) is divided by abs(n-rev[n]); zero if n=rev[n] (when n is palindromic), or when the quotient is an integer (see A087993).A087996
Residues when (n+rev[n]) is divided by abs(n-rev[n]); zero if n=rev[n] (when n is palindromic), or when the quotient is an integer (see A087993).
- a(n) is the least number with n palindromic divisors.A087997
a(n) is the least number with n palindromic divisors.
- a(n) = smallest number x such that sigma(x) = 2x + 2n.A087998
a(n) = smallest number x such that sigma(x) = 2x + 2n.
- a(n) is the LCM of palindromic divisors of n.A087999
a(n) is the LCM of palindromic divisors of n.
- a(n) is the sum of the palindromic divisors of n.A088000
a(n) is the sum of the palindromic divisors of n.
- a(n) is the sum of non-palindromic divisors of n.A088001
a(n) is the sum of non-palindromic divisors of n.
- Expansion of (1+x^2)/(1+x^2+x^5).A088002
Expansion of (1+x^2)/(1+x^2+x^5).
- Take the list t(n,0) = {1,...,n}; denote by t(n,j) this list after rotating to left (or right) by j positions. Calculate inner product of t(n,0) and t(n,j) and denote the value by s(n,j). Compute this inner product for all j = 1..n and choose the smallest. This is a(n).A088003
Take the list t(n,0) = {1,...,n}; denote by t(n,j) this list after rotating to left (or right) by j positions. Calculate inner product of t(n,0) and t(n,j) and denote the value by s(n,j). Compute this inner product for all j = 1..n and choose the smallest. This is a(n).
- "Truncated Mertens function": values of -1 at primes are left out, that is, summatory Moebius when argument runs through nonprimes.A088004
"Truncated Mertens function": values of -1 at primes are left out, that is, summatory Moebius when argument runs through nonprimes.
- Numbers whose abundance is (+-1) times a prime.A088005
Numbers whose abundance is (+-1) times a prime.
- Abundance values of numbers whose abundance is (+-1) times a prime.A088006
Abundance values of numbers whose abundance is (+-1) times a prime.
- Numbers n such that abs(sigma(n) - 2n) <= sqrt(n).A088007
Numbers n such that abs(sigma(n) - 2n) <= sqrt(n).
- Solutions to sigma(x) - 2x <= x^(1/3), both even and odd. Abundance-radius = abs(sigma(n)-2n) does not exceed 3rd root of n.A088008
Solutions to sigma(x) - 2x <= x^(1/3), both even and odd. Abundance-radius = abs(sigma(n)-2n) does not exceed 3rd root of n.
- Number of "sets of odd lists", cf. A000262.A088009
Number of "sets of odd lists", cf. A000262.
- Odd numbers n such that abs(sigma(n)-2n) <= n^(1/3). Abundance-radius = abs(sigma(n)-2n) does not exceed cubic root of n and n is odd.A088010
Odd numbers n such that abs(sigma(n)-2n) <= n^(1/3). Abundance-radius = abs(sigma(n)-2n) does not exceed cubic root of n and n is odd.