Sequences
392,541 sequences
- Numbers of the form x^2-9^y >= 0.A051211
Numbers of the form x^2-9^y >= 0.
- Numbers of the form x^2-10^y >= 0.A051212
Numbers of the form x^2-10^y >= 0.
- Numbers of the form 2^x-y^2 >= 0.A051213
Numbers of the form 2^x-y^2 >= 0.
- Numbers of the form 3^x-y^2 >= 0.A051214
Numbers of the form 3^x-y^2 >= 0.
- Numbers of the form 4^x-y^2 >= 0.A051215
Numbers of the form 4^x-y^2 >= 0.
- Numbers of the form 5^x-y^2 >= 0.A051216
Numbers of the form 5^x-y^2 >= 0.
- Nonnegative numbers of the form 6^x - y^2.A051217
Nonnegative numbers of the form 6^x - y^2.
- Numbers of the form 7^x-y^2 >= 0.A051218
Numbers of the form 7^x-y^2 >= 0.
- Numbers of the form 8^x-y^2 >= 0.A051219
Numbers of the form 8^x-y^2 >= 0.
- Numbers of the form 9^x-y^2 >= 0.A051220
Numbers of the form 9^x-y^2 >= 0.
- Numbers of the form 10^x-y^2 >= 0.A051221
Numbers of the form 10^x-y^2 >= 0.
- Numbers k such that Bernoulli number B_{k} has denominator 6.A051222
Numbers k such that Bernoulli number B_{k} has denominator 6.
- Number of ways of placing n nonattacking superqueens on an n X n board.A051223
Number of ways of placing n nonattacking superqueens on an n X n board.
- Number of ways of placing n nonattacking superqueens on n X n board (symmetric solutions count only once).A051224
Number of ways of placing n nonattacking superqueens on n X n board (symmetric solutions count only once).
- Numbers m such that the Bernoulli number B_{2*m} has denominator 30.A051225
Numbers m such that the Bernoulli number B_{2*m} has denominator 30.
- Numbers m such that the Bernoulli number B_m has denominator 30.A051226
Numbers m such that the Bernoulli number B_m has denominator 30.
- Numbers m such that the Bernoulli number B_{2*m} has denominator 42.A051227
Numbers m such that the Bernoulli number B_{2*m} has denominator 42.
- Numbers m such that the Bernoulli number B_m has denominator 42.A051228
Numbers m such that the Bernoulli number B_m has denominator 42.
- Numbers m such that the Bernoulli number B_{2*m} has denominator 66.A051229
Numbers m such that the Bernoulli number B_{2*m} has denominator 66.
- Numbers m such that the Bernoulli number B_m has denominator 66.A051230
Numbers m such that the Bernoulli number B_m has denominator 66.
- Generalized Stirling number triangle of the first kind.A051231
Generalized Stirling number triangle of the first kind.
- 9-factorial numbers.A051232
9-factorial numbers.
- Number of unit squares at least 50% covered by a circle inscribed in an integer square of size n X n.A051233
Number of unit squares at least 50% covered by a circle inscribed in an integer square of size n X n.
- Possible orders of central factor groups of groups.A051234
Possible orders of central factor groups of groups.
- Number of distinct most-perfect pandiagonal magic squares of order 4n in the Frenicle standard form.A051235
Number of distinct most-perfect pandiagonal magic squares of order 4n in the Frenicle standard form.
- Largest integer a(n) for which the integer interval [ 0,a(n) ] is a subset of the set of determinants of all n X n 0-1 matrices.A051236
Largest integer a(n) for which the integer interval [ 0,a(n) ] is a subset of the set of determinants of all n X n 0-1 matrices.
- Lexicographically earliest prime pyramid, read by rows.A051237
Lexicographically earliest prime pyramid, read by rows.
- First appearance of string n in e.A051238
First appearance of string n in e.
- Number of ways to arrange integers 1 through n so that the sum of each adjacent pair is prime, not counting reversals.A051239
Number of ways to arrange integers 1 through n so that the sum of each adjacent pair is prime, not counting reversals.
- Number of 4-uniform hypergraphs on n unlabeled nodes, or equivalently pure 3-dimensional simplicial complexes on n unlabeled nodes.A051240
Number of 4-uniform hypergraphs on n unlabeled nodes, or equivalently pure 3-dimensional simplicial complexes on n unlabeled nodes.
- Number of relations with 5 arguments on n nodes.A051241
Number of relations with 5 arguments on n nodes.
- Array T by antidiagonals; T(n,k)=k-th binary number d(1),...,d(j) for which exactly n digits d(i) satisfy d(i)=d(j+1-i) (n=0,1,2,...; k=1,2,3,..).A051242
Array T by antidiagonals; T(n,k)=k-th binary number d(1),...,d(j) for which exactly n digits d(i) satisfy d(i)=d(j+1-i) (n=0,1,2,...; k=1,2,3,..).
- Base 3 numbers d(1)...d(j) such that d(i) != d(j+1-i) for all but 2 values of i.A051243
Base 3 numbers d(1)...d(j) such that d(i) != d(j+1-i) for all but 2 values of i.
- Binary numbers d(1)...d(j) such that d(i) = d(j+1-i) for all but two values of i.A051244
Binary numbers d(1)...d(j) such that d(i) = d(j+1-i) for all but two values of i.
- Binary numbers d(1)...d(j) such that d(i) != d(j+1-i) for all but two values of i.A051245
Binary numbers d(1)...d(j) such that d(i) != d(j+1-i) for all but two values of i.
- Binary numbers d(1)...d(j) such that d(i) != d(j+1-i) for all but 4 values of i.A051246
Binary numbers d(1)...d(j) such that d(i) != d(j+1-i) for all but 4 values of i.
- Binary numbers d(1)...d(j) such that d(i) = d(j+1-i) for all but 4 values of i.A051247
Binary numbers d(1)...d(j) such that d(i) = d(j+1-i) for all but 4 values of i.
- n^a(n) is the smallest power of n (with a(n) > 1) which starts with n.A051248
n^a(n) is the smallest power of n (with a(n) > 1) which starts with n.
- Pure 4-dimensional simplicial complexes on n unlabeled nodes.A051249
Pure 4-dimensional simplicial complexes on n unlabeled nodes.
- Numbers whose reduced residue system consists of 1 and prime powers only.A051250
Numbers whose reduced residue system consists of 1 and prime powers only.
- Number of self-complementary 3-plexes.A051251
Number of self-complementary 3-plexes.
- Number of essentially different ways of arranging numbers 1 through 2n around a circle so that sum of each pair of adjacent numbers is prime.A051252
Number of essentially different ways of arranging numbers 1 through 2n around a circle so that sum of each pair of adjacent numbers is prime.
- Weights of rotation-symmetric functions in n variables.A051253
Weights of rotation-symmetric functions in n variables.
- Mills primes.A051254
Mills primes.
- Number of cyclically symmetric transpose complement plane partitions in a 2n X 2n X 2n box.A051255
Number of cyclically symmetric transpose complement plane partitions in a 2n X 2n X 2n box.
- Numbers formed from binomial coefficients (mod 2) interpreted as digits in factorial base.A051256
Numbers formed from binomial coefficients (mod 2) interpreted as digits in factorial base.
- Numbers formed from binomial coefficients (mod 2+k) interpreted as digits in factorial base.A051257
Numbers formed from binomial coefficients (mod 2+k) interpreted as digits in factorial base.
- Fibocyclotomic numbers: numbers formed from cyclotomic polynomials and Fibonacci numbers (A000045).A051258
Fibocyclotomic numbers: numbers formed from cyclotomic polynomials and Fibonacci numbers (A000045).
- Every 25th Fibocyclotomic number.A051259
Every 25th Fibocyclotomic number.
- Every 25th Fibocyclotomic number divided by 5.A051260
Every 25th Fibocyclotomic number divided by 5.