Sequences
392,541 sequences
- Third column of triangle in A088643.A088861
Third column of triangle in A088643.
- Smallest number with exactly n prime factors (possibly with repetitions) such that in binary representation the divisors >1 form a prefix code.A088862
Smallest number with exactly n prime factors (possibly with repetitions) such that in binary representation the divisors >1 form a prefix code.
- Number of prime factors of n-th Mersenne number M(p_n).A088863
Number of prime factors of n-th Mersenne number M(p_n).
- Maximum of the products of left and right parts when splitting the binary representation of n.A088864
Maximum of the products of left and right parts when splitting the binary representation of n.
- (Sum of distinct prime factors)^(sum of prime exponents).A088865
(Sum of distinct prime factors)^(sum of prime exponents).
- Primes where flipping 6 and 9 is also prime.A088866
Primes where flipping 6 and 9 is also prime.
- Nonsquarefree elements of A003824, i.e., primitive solutions to a^4 + b^4 = c^4 + d^4 with nonsquarefree value on both sides of the equation.A088867
Nonsquarefree elements of A003824, i.e., primitive solutions to a^4 + b^4 = c^4 + d^4 with nonsquarefree value on both sides of the equation.
- Numbers n which are divisors of the number formed by concatenating (n-4), (n-3), (n-2) and (n-1) in that order.A088868
Numbers n which are divisors of the number formed by concatenating (n-4), (n-3), (n-2) and (n-1) in that order.
- Numbers n which are divisors of the number produced by concatenating (n-1), (n-2), ... (n-5) in that order.A088869
Numbers n which are divisors of the number produced by concatenating (n-1), (n-2), ... (n-5) in that order.
- Numbers n which are divisors of the number produced by concatenating (n-5), (n-4), ... (n-1) in that order.A088870
Numbers n which are divisors of the number produced by concatenating (n-5), (n-4), ... (n-1) in that order.
- Numbers n which are divisors of the number produced by concatenating (n-1), (n-2), ... (n-10) in that order.A088871
Numbers n which are divisors of the number produced by concatenating (n-1), (n-2), ... (n-10) in that order.
- Numbers n which are divisors of the number produced by concatenating (n-10), (n-9), (n-8), ... (n-1) in that order.A088872
Numbers n which are divisors of the number produced by concatenating (n-10), (n-9), (n-8), ... (n-1) in that order.
- Number of different values of A000005(d) where d is a divisor of n.A088873
Number of different values of A000005(d) where d is a divisor of n.
- T(n, k) = [x^k] (2*n)! [z^(2*n)] 1/cos(z)^x, triangle read by rows, for 0 <= k <= n.A088874
T(n, k) = [x^k] (2*n)! [z^(2*n)] 1/cos(z)^x, triangle read by rows, for 0 <= k <= n.
- Cyclotomic(n,-n) is prime.A088875
Cyclotomic(n,-n) is prime.
- Smallest positive-integer string not explicitly embedded (in a normal left-to-right fashion) in the full decimal expansion of n^(n^n).A088876
Smallest positive-integer string not explicitly embedded (in a normal left-to-right fashion) in the full decimal expansion of n^(n^n).
- Numbers k that are divisors of the number formed by concatenating (k-1), k and (k+1), in that order.A088877
Numbers k that are divisors of the number formed by concatenating (k-1), k and (k+1), in that order.
- Prime numbers p such that 3p - 2 is a prime.A088878
Prime numbers p such that 3p - 2 is a prime.
- Numbers n such that 3n + 5 is a prime.A088879
Numbers n such that 3n + 5 is a prime.
- Number of different values of A000005(m) when A056239(m) is equal to n.A088880
Number of different values of A000005(m) when A056239(m) is equal to n.
- If A056239(m) = n, then a(n) is the maximum value of A000005(m).A088881
If A056239(m) = n, then a(n) is the maximum value of A000005(m).
- Nontrivial palindromes in base 10 (i.e., palindromes that are not RepDigits such as 3, 111, 22222, or 888888888).A088882
Nontrivial palindromes in base 10 (i.e., palindromes that are not RepDigits such as 3, 111, 22222, or 888888888).
- Primes which when concatenated with their reverse and incremented by 2 yield a new prime.A088883
Primes which when concatenated with their reverse and incremented by 2 yield a new prime.
- Primes which when concatenated with their reverse and decremented by 2 yield a new prime.A088884
Primes which when concatenated with their reverse and decremented by 2 yield a new prime.
- Minimum number of consecutive previous nonnegative integers to n that must be concatenated together in descending order such that n divides the concatenated term, or zero if n divides no such concatenation.A088885
Minimum number of consecutive previous nonnegative integers to n that must be concatenated together in descending order such that n divides the concatenated term, or zero if n divides no such concatenation.
- Minimum number of consecutive previous nonnegative integers to n that must be concatenated together in ascending order such that n divides the concatenated term, or zero if n divides no such concatenation.A088886
Minimum number of consecutive previous nonnegative integers to n that must be concatenated together in ascending order such that n divides the concatenated term, or zero if n divides no such concatenation.
- Number of different prime signatures of the m values when A056239(m) is equal to n.A088887
Number of different prime signatures of the m values when A056239(m) is equal to n.
- Number of intersecting T_0-hypergraphs on a labeled n-set.A088888
Number of intersecting T_0-hypergraphs on a labeled n-set.
- Polynexus numbers of order 8.A088889
Polynexus numbers of order 8.
- Polynexus numbers of order 8.A088890
Polynexus numbers of order 8.
- Polynexus numbers of order 9.A088891
Polynexus numbers of order 9.
- Polynexus numbers of order 14.A088892
Polynexus numbers of order 14.
- Polynexus numbers of order 15.A088893
Polynexus numbers of order 15.
- Polynexus numbers of order 16.A088894
Polynexus numbers of order 16.
- Number of intersecting T_0-antichains on a labeled n-set.A088895
Number of intersecting T_0-antichains on a labeled n-set.
- Length of longest integral ladder that can be moved horizontally around the right angled corner where two hallway corridors of integral widths meet.A088896
Length of longest integral ladder that can be moved horizontally around the right angled corner where two hallway corridors of integral widths meet.
- T(n,k) = number of ordered pairs of integers (x,y) with x^2/n^2 + y^2/k^2 <= 1, 1<=k<=n; triangular array, read by rows.A088897
T(n,k) = number of ordered pairs of integers (x,y) with x^2/n^2 + y^2/k^2 <= 1, 1<=k<=n; triangular array, read by rows.
- T(n,k) = number of ordered pairs of integers (x,y) with x^2/n^2 + y^2/k^2 < 1, 1<=k<=n; triangular array, read by rows.A088898
T(n,k) = number of ordered pairs of integers (x,y) with x^2/n^2 + y^2/k^2 < 1, 1<=k<=n; triangular array, read by rows.
- T(n, k) = number of ordered pairs of integers (x,y) with x^2/n^2 + y^2/k^2 = 1, 1 <= k <= n; triangular array, read by rows.A088899
T(n, k) = number of ordered pairs of integers (x,y) with x^2/n^2 + y^2/k^2 = 1, 1 <= k <= n; triangular array, read by rows.
- Numbers n such that 2*n*k(n) is an integer, where k(n) is sum of successive remainders when computing the Euclidean algorithm for (1, 1/sqrt(n)) as defined in A086378 (MuPAD program is given there).A088900
Numbers n such that 2*n*k(n) is an integer, where k(n) is sum of successive remainders when computing the Euclidean algorithm for (1, 1/sqrt(n)) as defined in A086378 (MuPAD program is given there).
- Numbers n such that n*k(n) is an integer, where k(n) is sum of successive remainders when computing the Euclidean algorithm for (1, 1/sqrt(n)) as defined in A086378 (MuPAD program is given there).A088901
Numbers n such that n*k(n) is an integer, where k(n) is sum of successive remainders when computing the Euclidean algorithm for (1, 1/sqrt(n)) as defined in A086378 (MuPAD program is given there).
- Numbers n such that n = product (p_k)^(c_k) and set of its (c_k k's)'s is a self-conjugate partition, where p_k is k-th prime and c_k > 0.A088902
Numbers n such that n = product (p_k)^(c_k) and set of its (c_k k's)'s is a self-conjugate partition, where p_k is k-th prime and c_k > 0.
- Primes P such that P and P+2 are twin primes and P = p(n)# + p(m) with p(n) < p(m) < p(n+1)^2, or 0 if no such prime P for n, p(n)# = n-th primorial, p(m)= m-th prime ( p(m), p(m+1) twin primes ).A088903
Primes P such that P and P+2 are twin primes and P = p(n)# + p(m) with p(n) < p(m) < p(n+1)^2, or 0 if no such prime P for n, p(n)# = n-th primorial, p(m)= m-th prime ( p(m), p(m+1) twin primes ).
- Number of ways to write n = x^i + x^j with 1<x<=n and 0<=i<=j.A088904
Number of ways to write n = x^i + x^j with 1<x<=n and 0<=i<=j.
- Numbers m having exactly one representation m = x^i + x^j with 1<x<=m and 0<=i<=j.A088905
Numbers m having exactly one representation m = x^i + x^j with 1<x<=m and 0<=i<=j.
- Smallest number m>0 having n representations m = x^i + x^j with 1<x<=m and 0<=i<=j.A088906
Smallest number m>0 having n representations m = x^i + x^j with 1<x<=m and 0<=i<=j.
- Least k such that mean(1,1/2,...,1/k) <= 1/n.A088907
Least k such that mean(1,1/2,...,1/k) <= 1/n.
- Numbers expressible as sum or difference of the squares of two distinct primes.A088908
Numbers expressible as sum or difference of the squares of two distinct primes.
- Numbers expressible as the sum of squares of two distinct primes.A088909
Numbers expressible as the sum of squares of two distinct primes.
- Conjectured minimal required number k of terms in a representation n = Sum_{i=1..k} e_i*(p_i)^2 by distinct primes p_i, where e_i is 1 or -1.A088910
Conjectured minimal required number k of terms in a representation n = Sum_{i=1..k} e_i*(p_i)^2 by distinct primes p_i, where e_i is 1 or -1.