Sequences
392,541 sequences
- Primes p such that x^22 = 2 has no solution mod p.A059311
Primes p such that x^22 = 2 has no solution mod p.
- Primes p such that x^59 = 2 has no solution mod p.A059312
Primes p such that x^59 = 2 has no solution mod p.
- Primes p such that x^25 = 2 has no solution mod p.A059313
Primes p such that x^25 = 2 has no solution mod p.
- Primes p such that x^26 = 2 has no solution mod p.A059314
Primes p such that x^26 = 2 has no solution mod p.
- Primes p such that x^28 = 2 has no solution mod p.A059315
Primes p such that x^28 = 2 has no solution mod p.
- Least integer m such that between m and 2m (including endpoints) there are exactly n primes.A059316
Least integer m such that between m and 2m (including endpoints) there are exactly n primes.
- Pascal's "rhombus" (actually a triangle T(n,k), n >= 0, 0<=k<=2n) read by rows: each entry is sum of 3 terms above it in previous row and one term above it two rows back.A059317
Pascal's "rhombus" (actually a triangle T(n,k), n >= 0, 0<=k<=2n) read by rows: each entry is sum of 3 terms above it in previous row and one term above it two rows back.
- Pascal's "rhombus" (actually a triangle) mod 2, read by rows: each entry is sum modulo 2 of 3 terms above it in previous row and one term above it two rows back.A059318
Pascal's "rhombus" (actually a triangle) mod 2, read by rows: each entry is sum modulo 2 of 3 terms above it in previous row and one term above it two rows back.
- Number of 1's in row n of Pascal's rhombus mod 2.A059319
Number of 1's in row n of Pascal's rhombus mod 2.
- Number of 0's in row n of Pascal's rhombus mod 2.A059320
Number of 0's in row n of Pascal's rhombus mod 2.
- Smallest number m such that m^2+1 is divisible by A002144(n)^2 (= squares of primes congruent to 1 mod 4).A059321
Smallest number m such that m^2+1 is divisible by A002144(n)^2 (= squares of primes congruent to 1 mod 4).
- First differences of sequence of consecutive safe primes.A059322
First differences of sequence of consecutive safe primes.
- Smaller term of closest safe prime pairs.A059323
Smaller term of closest safe prime pairs.
- Numbers n such that 6n + 5 is composite.A059324
Numbers n such that 6n + 5 is composite.
- Numbers n such that 6n + 5 is prime.A059325
Numbers n such that 6n + 5 is prime.
- Numbers k such that 2*3^k + 7 is prime.A059326
Numbers k such that 2*3^k + 7 is prime.
- a(n) is smallest safe prime (A005385) such that a(n) + 12*n is the next safe prime, i.e., x = (a(n) - 1)/2 and x + 6*n are closest Sophie Germain primes.A059327
a(n) is smallest safe prime (A005385) such that a(n) + 12*n is the next safe prime, i.e., x = (a(n) - 1)/2 and x + 6*n are closest Sophie Germain primes.
- Table T(n,k) = T(n - 1,k) + T(n,k - 1) + T(n - 1,k)*T(n,k - 1) starting with T(0,0)=1, read by antidiagonals.A059328
Table T(n,k) = T(n - 1,k) + T(n,k - 1) + T(n - 1,k)*T(n,k - 1) starting with T(0,0)=1, read by antidiagonals.
- Number of 3 X 3 matrices, with elements from {0,...,n}, having the property that the middle element of each of the eight 3-element horizontal, vertical and diagonal lines equals the average of the two end elements.A059329
Number of 3 X 3 matrices, with elements from {0,...,n}, having the property that the middle element of each of the eight 3-element horizontal, vertical and diagonal lines equals the average of the two end elements.
- Primes p such that x^67 = 2 has no solution mod p.A059330
Primes p such that x^67 = 2 has no solution mod p.
- Primes p such that x^24 = 2 has no solution mod p, but x^12 = 2 has a solution mod p.A059331
Primes p such that x^24 = 2 has no solution mod p, but x^12 = 2 has a solution mod p.
- Determinant of n X n matrix A defined by A[i,j] = (i+j-1)! for 1 <= i,j <= n.A059332
Determinant of n X n matrix A defined by A[i,j] = (i+j-1)! for 1 <= i,j <= n.
- For 0<=A, 0<=B, n is an A-almost prime; m is a B-almost prime, k = n+m, k is a C-almost prime; a(n) = smallest number m such that A+B=C.A059333
For 0<=A, 0<=B, n is an A-almost prime; m is a B-almost prime, k = n+m, k is a C-almost prime; a(n) = smallest number m such that A+B=C.
- Primes p such that x^30 = 2 has no solution mod p.A059334
Primes p such that x^30 = 2 has no solution mod p.
- Primes p such that x^33 = 2 has no solution mod p.A059335
Primes p such that x^33 = 2 has no solution mod p.
- Primes p such that x^34 = 2 has no solution mod p.A059336
Primes p such that x^34 = 2 has no solution mod p.
- Primes p such that x^35 = 2 has no solution mod p.A059337
Primes p such that x^35 = 2 has no solution mod p.
- a(n) = Sum_{k=1..n} k^5 * binomial(n,k).A059338
a(n) = Sum_{k=1..n} k^5 * binomial(n,k).
- a(n) is the number of representations of n as a sum x+y, such that bigomega(n) = bigomega(x)+bigomega(y) and 1 <= x <= y < n.A059339
a(n) is the number of representations of n as a sum x+y, such that bigomega(n) = bigomega(x)+bigomega(y) and 1 <= x <= y < n.
- Triangle T(n,k) of numbers with e.g.f. exp((exp((1+x)*y)-1)/(1+x)), k=0..n-1.A059340
Triangle T(n,k) of numbers with e.g.f. exp((exp((1+x)*y)-1)/(1+x)), k=0..n-1.
- Triangle giving numerators of coefficients of Euler polynomials, highest powers first.A059341
Triangle giving numerators of coefficients of Euler polynomials, highest powers first.
- Triangle giving denominators of coefficients of Euler polynomials, highest powers first.A059342
Triangle giving denominators of coefficients of Euler polynomials, highest powers first.
- Triangle of nonzero coefficients of Hermite polynomials H_n(x) in increasing powers of x.A059343
Triangle of nonzero coefficients of Hermite polynomials H_n(x) in increasing powers of x.
- Triangle read by rows: row n consists of the nonzero coefficients of the expansion of 2^n x^n in terms of Hermite polynomials with decreasing subscripts.A059344
Triangle read by rows: row n consists of the nonzero coefficients of the expansion of 2^n x^n in terms of Hermite polynomials with decreasing subscripts.
- Central column of Pascal's "rhombus" (actually a triangle) A059317.A059345
Central column of Pascal's "rhombus" (actually a triangle) A059317.
- Difference array of Catalan numbers A000108 read by antidiagonals.A059346
Difference array of Catalan numbers A000108 read by antidiagonals.
- Difference array of Motzkin numbers A001006 read by antidiagonals.A059347
Difference array of Motzkin numbers A001006 read by antidiagonals.
- Third diagonal of array in A059347.A059348
Third diagonal of array in A059347.
- Primes p such that x^32 = 2 has no solution mod p.A059349
Primes p such that x^32 = 2 has no solution mod p.
- Primes p such that x^38 = 2 has no solution mod p.A059350
Primes p such that x^38 = 2 has no solution mod p.
- Primes p such that x^39 = 2 has no solution mod p.A059351
Primes p such that x^39 = 2 has no solution mod p.
- Primes p such that x^40 = 2 has no solution mod p.A059352
Primes p such that x^40 = 2 has no solution mod p.
- Primes p such that x^42 = 2 has no solution mod p.A059353
Primes p such that x^42 = 2 has no solution mod p.
- Primes p such that x^27 = 2 has no solution mod p, but x^9 = 2 has a solution mod p.A059354
Primes p such that x^27 = 2 has no solution mod p, but x^9 = 2 has a solution mod p.
- Number of chains of n-3 partitions in the reduced partition lattice on n elements.A059355
Number of chains of n-3 partitions in the reduced partition lattice on n elements.
- A diagonal of triangle in A008298.A059356
A diagonal of triangle in A008298.
- A diagonal of triangle in A008298.A059357
A diagonal of triangle in A008298.
- Coefficients in expansion of Sum_{n >= 1} x^n/(1-x^n)^4.A059358
Coefficients in expansion of Sum_{n >= 1} x^n/(1-x^n)^4.
- Numbers n such that n = A059333(A059333(n)).A059359
Numbers n such that n = A059333(A059333(n)).
- a(n) = A059333(2^n).A059360
a(n) = A059333(2^n).