Sequences
392,541 sequences
- Numbers k such that there is an arrangement of k points in the plane such that no point is on >= k/2 connecting lines.A058211
Numbers k such that there is an arrangement of k points in the plane such that no point is on >= k/2 connecting lines.
- a(n) = 1 + floor(n*(n-3)/6).A058212
a(n) = 1 + floor(n*(n-3)/6).
- Triangular arrangement of solutions of phi(x) = 2^n (n >= 0), where phi=A000010 is Euler's totient function. Each row corresponds to a particular n and its length is n+2 for 0 <= n <= 31, 32 for n >= 32. (This assumes that there are only 5 Fermat primes.)A058213
Triangular arrangement of solutions of phi(x) = 2^n (n >= 0), where phi=A000010 is Euler's totient function. Each row corresponds to a particular n and its length is n+2 for 0 <= n <= 31, 32 for n >= 32. (This assumes that there are only 5 Fermat primes.)
- Sum of solutions of phi(x) = 2^n.A058214
Sum of solutions of phi(x) = 2^n.
- Largest solution of phi(x) = 2^n.A058215
Largest solution of phi(x) = 2^n.
- Numbers n such that x^n + x^12 + 2 is irreducible over GF(3).A058216
Numbers n such that x^n + x^12 + 2 is irreducible over GF(3).
- Numbers n such that x^n + x^11 + 2 is irreducible over GF(3).A058217
Numbers n such that x^n + x^11 + 2 is irreducible over GF(3).
- Positive integers that cannot be represented in the form n=5|ab|+a+b for any choice of nonzero integers a and b (positive or negative).A058218
Positive integers that cannot be represented in the form n=5|ab|+a+b for any choice of nonzero integers a and b (positive or negative).
- Numbers n such that x^n + x^13 + 2 is irreducible over GF(3).A058219
Numbers n such that x^n + x^13 + 2 is irreducible over GF(3).
- Ultra-useful primes: smallest k such that 2^(2^n) - k is prime.A058220
Ultra-useful primes: smallest k such that 2^(2^n) - k is prime.
- Next-to-smallest k such that 2^(2^n) - k is prime.A058221
Next-to-smallest k such that 2^(2^n) - k is prime.
- Tree of tournament sequences read across rows.A058222
Tree of tournament sequences read across rows.
- Tree of Meeussen sequences read across rows.A058223
Tree of Meeussen sequences read across rows.
- Largest d such that the linear programming bound for quantum codes of length n is feasible for some real K>1.A058224
Largest d such that the linear programming bound for quantum codes of length n is feasible for some real K>1.
- Numbers that are inconsummate to some base.A058225
Numbers that are inconsummate to some base.
- Panconsummate numbers (consummate in all bases >=2).A058226
Panconsummate numbers (consummate in all bases >=2).
- Number of edges in all simple (loopless) paths, connecting any node with all the remaining ones in optimal graphs of degree 4.A058227
Number of edges in all simple (loopless) paths, connecting any node with all the remaining ones in optimal graphs of degree 4.
- Numbers k that divide the difference between the sum of the first k partition numbers (A000041) and the sum of the first k unique partition numbers (A000009).A058228
Numbers k that divide the difference between the sum of the first k partition numbers (A000041) and the sum of the first k unique partition numbers (A000009).
- Digits composite, each digit minus 1 is prime, sum of digits minus 1 is prime, difference of digits (in absolute value) minus 1 is prime.A058229
Digits composite, each digit minus 1 is prime, sum of digits minus 1 is prime, difference of digits (in absolute value) minus 1 is prime.
- Numbers k such that the product of the lengths of the words in the name of k in American English is equal to k.A058230
Numbers k such that the product of the lengths of the words in the name of k in American English is equal to k.
- A Somos-8 sequence.A058231
A Somos-8 sequence.
- a(n) = (a(n-1)a(n-5) + a(n-2)a(n-4) + a(n-3)^2)/a(n-6).A058232
a(n) = (a(n-1)a(n-5) + a(n-2)a(n-4) + a(n-3)^2)/a(n-6).
- Primes p such that p#+1 is divisible by the next prime after p.A058233
Primes p such that p#+1 is divisible by the next prime after p.
- Numbers n such that x^n + x^9 + 2 is irreducible over GF(3).A058234
Numbers n such that x^n + x^9 + 2 is irreducible over GF(3).
- Numbers n such that x^n + x^2 + 2 is irreducible over GF(3).A058235
Numbers n such that x^n + x^2 + 2 is irreducible over GF(3).
- Numbers n such that x^n + x^3 + 2 is irreducible over GF(3).A058236
Numbers n such that x^n + x^3 + 2 is irreducible over GF(3).
- Numbers k such that x^k + x^4 + 2 is irreducible over GF(3).A058237
Numbers k such that x^k + x^4 + 2 is irreducible over GF(3).
- Numbers k such that x^k + x^5 + 2 is irreducible over GF(3).A058238
Numbers k such that x^k + x^5 + 2 is irreducible over GF(3).
- (7^n)-th prime.A058239
(7^n)-th prime.
- Numbers k such that x^k + x^6 + 2 is irreducible over GF(3).A058240
Numbers k such that x^k + x^6 + 2 is irreducible over GF(3).
- Number of sets of n positive integers that can be placed along a circle such that the set of sums of adjacent integers forms { 1, 2, ..., n^2-n+1 }.A058241
Number of sets of n positive integers that can be placed along a circle such that the set of sums of adjacent integers forms { 1, 2, ..., n^2-n+1 }.
- Numbers n such that x^n + x^7 + 2 is irreducible over GF(3).A058242
Numbers n such that x^n + x^7 + 2 is irreducible over GF(3).
- Numbers n such that x^n + x^8 + 1 is irreducible over GF(3).A058243
Numbers n such that x^n + x^8 + 1 is irreducible over GF(3).
- 11^n-th prime.A058244
11^n-th prime.
- (12^n)-th prime.A058245
(12^n)-th prime.
- (13^n)-th prime.A058246
(13^n)-th prime.
- Number of primes <= 11^n.A058247
Number of primes <= 11^n.
- Number of primes <= 12^n.A058248
Number of primes <= 12^n.
- (Smallest prime >= 2^n) - (largest prime <= 2^n).A058249
(Smallest prime >= 2^n) - (largest prime <= 2^n).
- GCD of n-th primorial number and its totient.A058250
GCD of n-th primorial number and its totient.
- LCM of n-th primorial number and its Euler totient.A058251
LCM of n-th primorial number and its Euler totient.
- Initial prime in set of 4 consecutive primes with common difference 36.A058252
Initial prime in set of 4 consecutive primes with common difference 36.
- Primes p such that 4^p - 3 is prime.A058253
Primes p such that 4^p - 3 is prime.
- a(n) = lcm{prime(i)-1, i=1..n}.A058254
a(n) = lcm{prime(i)-1, i=1..n}.
- Distinct values of lcm_{i=1..n} (p(i)-1), where p() are the primes.A058255
Distinct values of lcm_{i=1..n} (p(i)-1), where p() are the primes.
- a(n) = A058254(n+1)/A058254(n).A058256
a(n) = A058254(n+1)/A058254(n).
- Triangle read by rows: this is a variant of A008280 in which 2 rows go from left to right, 2 from right to left, 2 from left to right, etc.A058257
Triangle read by rows: this is a variant of A008280 in which 2 rows go from left to right, 2 from right to left, 2 from left to right, etc.
- The 2-Up sequence: formed from final entries in rows of A058257.A058258
The 2-Up sequence: formed from final entries in rows of A058257.
- Number of split semiorders on n points.A058259
Number of split semiorders on n points.
- Number of minimal forbidden posets for split semiorders on n points.A058260
Number of minimal forbidden posets for split semiorders on n points.