Sequences
392,541 sequences
- Numbers k such that sopfr(k) is a semiprime.A085711
Numbers k such that sopfr(k) is a semiprime.
- Semiprimes n such that lpf(n)^spf(n)+1 is also semiprime, where lpf(n) is larger prime factor of n and spf(n) is smaller prime factor of n.A085712
Semiprimes n such that lpf(n)^spf(n)+1 is also semiprime, where lpf(n) is larger prime factor of n and spf(n) is smaller prime factor of n.
- Consider numbers k such that phi(x) = k has exactly 3 solutions and they are (3*p, 4*p, 6*p) where p is 1 or a prime. Sequence gives values of p.A085713
Consider numbers k such that phi(x) = k has exactly 3 solutions and they are (3*p, 4*p, 6*p) where p is 1 or a prime. Sequence gives values of p.
- Degrees for which Gassmann triples do not exist.A085714
Degrees for which Gassmann triples do not exist.
- Squarefree conductors of quintic fields.A085715
Squarefree conductors of quintic fields.
- Class numbers of fields in A085715.A085716
Class numbers of fields in A085715.
- Consider the square lattice L and the sublattice K of index 5 spanned by (2,-1), (1,2); a(n) = number of points (x,y) in M with x >= 0, y >= 0, x+y <= n.A085717
Consider the square lattice L and the sublattice K of index 5 spanned by (2,-1), (1,2); a(n) = number of points (x,y) in M with x >= 0, y >= 0, x+y <= n.
- Numbers n such that sopfr(n)/spf(n) is a semiprime and sopfr(n)/lpf(n) is a semiprime, where sopfr(n) = A001414(n) is sum of primes dividing n (with repetition), spf(n) and lpf(n) are smallest and largest primes dividing n, respectively. Also, spf(n)!=lpf(n).A085718
Numbers n such that sopfr(n)/spf(n) is a semiprime and sopfr(n)/lpf(n) is a semiprime, where sopfr(n) = A001414(n) is sum of primes dividing n (with repetition), spf(n) and lpf(n) are smallest and largest primes dividing n, respectively. Also, spf(n)!=lpf(n).
- Permanent of n X n matrix whose rows are cyclic permutations of 1..n.A085719
Permanent of n X n matrix whose rows are cyclic permutations of 1..n.
- Start of a run of 7 successive numbers which when concatenated form a prime.A085720
Start of a run of 7 successive numbers which when concatenated form a prime.
- Semiprimes whose prime factors have an equal number of digits in binary representation.A085721
Semiprimes whose prime factors have an equal number of digits in binary representation.
- Numbers k such that k^2 + 1 is a semiprime.A085722
Numbers k such that k^2 + 1 is a semiprime.
- Number of prime divisors of n^n+1 (counted with multiplicity).A085723
Number of prime divisors of n^n+1 (counted with multiplicity).
- Numbers k such that 2^k - 1 is a semiprime (A001358).A085724
Numbers k such that 2^k - 1 is a semiprime (A001358).
- Numbers k such that 1 + (product of first k primes) is a semiprime.A085725
Numbers k such that 1 + (product of first k primes) is a semiprime.
- Numbers n such that n-th Lucas number is a semiprime.A085726
Numbers n such that n-th Lucas number is a semiprime.
- Number of semiprimes between n and 2n (inclusive).A085727
Number of semiprimes between n and 2n (inclusive).
- There are never n semiprimes between any k and 2k; or values which do not occur in the sequence of number of semiprimes between n and 2n (inclusive).A085728
There are never n semiprimes between any k and 2k; or values which do not occur in the sequence of number of semiprimes between n and 2n (inclusive).
- Sum of prime factors of prime powers.A085729
Sum of prime factors of prime powers.
- Euler's totient function applied to the sequence of prime powers.A085730
Euler's totient function applied to the sequence of prime powers.
- Greatest common divisor of n and its arithmetic derivative.A085731
Greatest common divisor of n and its arithmetic derivative.
- Smallest number obtained by placing a + in the first n digits of decimal expansion of Pi.A085732
Smallest number obtained by placing a + in the first n digits of decimal expansion of Pi.
- Right-truncatable semiprimes.A085733
Right-truncatable semiprimes.
- Triangle read by rows: T(0,0) = 1, T(n,k) = Sum_{j=max(0,1-k)..n-k} (2^j)*(binomial(k+j,1+j) + binomial(k+j+1,1+j))*T(n-1,k-1+j).A085734
Triangle read by rows: T(0,0) = 1, T(n,k) = Sum_{j=max(0,1-k)..n-k} (2^j)*(binomial(k+j,1+j) + binomial(k+j+1,1+j))*T(n-1,k-1+j).
- Lyrics of "Aquarius", by Boards of Canada.A085735
Lyrics of "Aquarius", by Boards of Canada.
- Numbers n such that all groups of order n are solvable.A085736
Numbers n such that all groups of order n are solvable.
- Numerators in triangle formed from Bernoulli numbers.A085737
Numerators in triangle formed from Bernoulli numbers.
- Denominators in triangle formed from Bernoulli numbers.A085738
Denominators in triangle formed from Bernoulli numbers.
- Partial sums of A034953(n).A085739
Partial sums of A034953(n).
- a(n) = T(n)^2 - n^2, where T(n) is a triangular number.A085740
a(n) = T(n)^2 - n^2, where T(n) is a triangular number.
- a(n) = T(n)^n, where T() are the triangular numbers (A000217).A085741
a(n) = T(n)^n, where T() are the triangular numbers (A000217).
- a(n) = T(n^3) - T(n), where T() are the triangular numbers (A000217).A085742
a(n) = T(n^3) - T(n), where T() are the triangular numbers (A000217).
- a(n) = T(n^3) - T(n^2), where T() are the triangular numbers (A000217).A085743
a(n) = T(n^3) - T(n^2), where T() are the triangular numbers (A000217).
- a(n) = A000217(n^3) - n^3.A085744
a(n) = A000217(n^3) - n^3.
- Numbers m such that 2^m + m is a semiprime.A085745
Numbers m such that 2^m + m is a semiprime.
- Numbers n such that n^2 + n + 1 is a semiprime.A085746
Numbers n such that n^2 + n + 1 is a semiprime.
- Least positive k such that n! + k is a semiprime.A085747
Least positive k such that n! + k is a semiprime.
- G.f.: 1/(1-G001190), where G001190 = x + x^2 + x^3 + 2x^4 + 3x^5 + ... is the g.f. for the Wedderburn-Etherington numbers A001190.A085748
G.f.: 1/(1-G001190), where G001190 = x + x^2 + x^3 + 2x^4 + 3x^5 + ... is the g.f. for the Wedderburn-Etherington numbers A001190.
- Largest prime p for which every solution of the congruence x^n + y^n == z^n (mod p) is such that p divides x*y*z.A085749
Largest prime p for which every solution of the congruence x^n + y^n == z^n (mod p) is such that p divides x*y*z.
- Determinant of the symmetric n X n matrix A defined by A[i,j] = |i-j| for 1 <= i,j <= n.A085750
Determinant of the symmetric n X n matrix A defined by A[i,j] = |i-j| for 1 <= i,j <= n.
- Semiprimes whose reversal is also a semiprime.A085751
Semiprimes whose reversal is also a semiprime.
- Duplicate of A074966.A085752
Duplicate of A074966.
- Least k such that n^n + k is a semiprime.A085753
Least k such that n^n + k is a semiprime.
- Numbers n such that (digital sum of n)^3 = reversal of n. (Powers of 10 excluded.)A085754
Numbers n such that (digital sum of n)^3 = reversal of n. (Powers of 10 excluded.)
- Number of partitions of n into a prime number of prime parts.A085755
Number of partitions of n into a prime number of prime parts.
- Number of partitions into a prime number of distinct parts.A085756
Number of partitions into a prime number of distinct parts.
- Differences between successive multiples of either 11 or 19.A085757
Differences between successive multiples of either 11 or 19.
- Least m such that phi(x)=2m has exactly n solutions.A085758
Least m such that phi(x)=2m has exactly n solutions.
- Prime powers of the form 4n+1.A085759
Prime powers of the form 4n+1.
- Prime powers of the form 4n+3.A085760
Prime powers of the form 4n+3.