Sequences
392,541 sequences
- Third unsigned column of triangle A051379.A051561
Third unsigned column of triangle A051379.
- Second unsigned column of triangle A051380.A051562
Second unsigned column of triangle A051380.
- Third unsigned column of triangle A051380.A051563
Third unsigned column of triangle A051380.
- Second unsigned column of triangle A051523.A051564
Second unsigned column of triangle A051523.
- Third unsigned column of triangle A051523.A051565
Third unsigned column of triangle A051523.
- Erroneous version of A051567.A051566
Erroneous version of A051567.
- Consider problem of placing N queens on an n X n board so that each queen attacks precisely k others. Here k=1 and sequence gives number of inequivalent solutions when N is equal to the upper bound 2*floor(2n/3).A051567
Consider problem of placing N queens on an n X n board so that each queen attacks precisely k others. Here k=1 and sequence gives number of inequivalent solutions when N is equal to the upper bound 2*floor(2n/3).
- Let M(n) (A051755) be the maximal number of queens that can be placed on an n X n chessboard so that each queen attacks exactly two other queens; a(n) is the number of non-equivalent solutions. "Non-equivalent" means none of the a(n) solutions can be mapped onto any other solution by board rotations through 90, 180 or 270 degrees or mirror operations along the two diagonals or center lines.A051568
Let M(n) (A051755) be the maximal number of queens that can be placed on an n X n chessboard so that each queen attacks exactly two other queens; a(n) is the number of non-equivalent solutions. "Non-equivalent" means none of the a(n) solutions can be mapped onto any other solution by board rotations through 90, 180 or 270 degrees or mirror operations along the two diagonals or center lines.
- Consider the problem of placing N = A051756(n) queens on an n X n board so that each queen attacks precisely 3 others; a(n) gives the number of inequivalent solutions.A051569
Consider the problem of placing N = A051756(n) queens on an n X n board so that each queen attacks precisely 3 others; a(n) gives the number of inequivalent solutions.
- Consider the problem of placing N queens on an n X n board so that each queen attacks precisely k others. Here k=3 and sequence gives number of different solutions when N takes its maximal value.A051570
Consider the problem of placing N queens on an n X n board so that each queen attacks precisely k others. Here k=3 and sequence gives number of different solutions when N takes its maximal value.
- Consider problem of placing N queens on an n X n board so that each queen attacks precisely k others. Here k=4 and sequence gives number of inequivalent solutions when N = 3*n-3.A051571
Consider problem of placing N queens on an n X n board so that each queen attacks precisely k others. Here k=4 and sequence gives number of inequivalent solutions when N = 3*n-3.
- a(1) = 5, a(n) = sigma(a(n-1)).A051572
a(1) = 5, a(n) = sigma(a(n-1)).
- INVERTi transform of A000081 = [1, 2, 4, 9, 20, 48, 115, 286, 719, 1842, 4766, 12486,...].A051573
INVERTi transform of A000081 = [1, 2, 4, 9, 20, 48, 115, 286, 719, 1842, 4766, 12486,...].
- a(n) = number of k, 1<=k<=n, such that (n*k) divides binomial(n,k).A051574
a(n) = number of k, 1<=k<=n, such that (n*k) divides binomial(n,k).
- a(n) = LCM { Catalan(0), ..., Catalan(n) }.A051575
a(n) = LCM { Catalan(0), ..., Catalan(n) }.
- Order of Burnside group B(3,n) of exponent 3 and rank n.A051576
Order of Burnside group B(3,n) of exponent 3 and rank n.
- a(n) = (2*n + 3)!!/3 = A001147(n+2)/3.A051577
a(n) = (2*n + 3)!!/3 = A001147(n+2)/3.
- a(n) = (2*n+4)!!/4!!, related to A000165 (even double factorials).A051578
a(n) = (2*n+4)!!/4!!, related to A000165 (even double factorials).
- a(n) = (2*n+5)!!/5!!, related to A001147 (odd double factorials).A051579
a(n) = (2*n+5)!!/5!!, related to A001147 (odd double factorials).
- a(n) = (2*n+6)!!/6!!, related to A000165 (even double factorials).A051580
a(n) = (2*n+6)!!/6!!, related to A000165 (even double factorials).
- a(n) = (2*n+7)!!/7!!, related to A001147 (odd double factorials).A051581
a(n) = (2*n+7)!!/7!!, related to A001147 (odd double factorials).
- a(n) = (2*n+8)!!/8!!, related to A000165 (even double factorials).A051582
a(n) = (2*n+8)!!/8!!, related to A000165 (even double factorials).
- a(n) = (2*n+9)!!/9!!, related to A001147 (odd double factorials).A051583
a(n) = (2*n+9)!!/9!!, related to A001147 (odd double factorials).
- Number of integer-sided triangles of area n.A051584
Number of integer-sided triangles of area n.
- Number of integer-sided triangles of area 6n.A051585
Number of integer-sided triangles of area 6n.
- There are exactly n integer-sided triangles of area a(n).A051586
There are exactly n integer-sided triangles of area a(n).
- Number of 4 X n binary matrices such that any 2 rows have a common 1.A051587
Number of 4 X n binary matrices such that any 2 rows have a common 1.
- Number of 3 X n binary matrices such that any 2 rows have a common 1.A051588
Number of 3 X n binary matrices such that any 2 rows have a common 1.
- Number of 5 X n binary matrices such that any 2 rows have a common 1.A051589
Number of 5 X n binary matrices such that any 2 rows have a common 1.
- Number of oriented triangle graphs on binomial(n,2) points.A051590
Number of oriented triangle graphs on binomial(n,2) points.
- Number of oriented triangle graphs with transitively oriented maximal cliques, on binomial(n,2) points.A051591
Number of oriented triangle graphs with transitively oriented maximal cliques, on binomial(n,2) points.
- Numbers k such that k!!!!!! - 1 is prime.A051592
Numbers k such that k!!!!!! - 1 is prime.
- Largest order of even permutation of n elements, or maximal order of element of alternating group A_n.A051593
Largest order of even permutation of n elements, or maximal order of element of alternating group A_n.
- Maximal elements of pairs of "(-1)sigma amicable numbers", sorted by their minimal elements.A051594
Maximal elements of pairs of "(-1)sigma amicable numbers", sorted by their minimal elements.
- Minimal elements of pairs of "(-1)sigma amicable numbers", sorted by their minimal elements.A051595
Minimal elements of pairs of "(-1)sigma amicable numbers", sorted by their minimal elements.
- Numerical values or Gematriot of Hebrew letters {aleph, bet, ..., tav}.A051596
Numerical values or Gematriot of Hebrew letters {aleph, bet, ..., tav}.
- Rows of triangle formed using Pascal's rule except begin and end n-th row with n+1.A051597
Rows of triangle formed using Pascal's rule except begin and end n-th row with n+1.
- Rows of triangle formed using Pascal's rule except begin n-th row with 2*n and end it with 2*n+1.A051598
Rows of triangle formed using Pascal's rule except begin n-th row with 2*n and end it with 2*n+1.
- Rows of triangle formed using Pascal's rule except begin and end n-th row with (n+1)st prime.A051599
Rows of triangle formed using Pascal's rule except begin and end n-th row with (n+1)st prime.
- Rows of triangle formed using Pascal's rule except begin n-th row with (n+1)st prime and end it with (n+2)nd prime.A051600
Rows of triangle formed using Pascal's rule except begin n-th row with (n+1)st prime and end it with (n+2)nd prime.
- Rows of triangle formed using Pascal's rule except we begin and end the n-th row with n.A051601
Rows of triangle formed using Pascal's rule except we begin and end the n-th row with n.
- a(n) is the maximal number of squares that can be formed from n points in the plane.A051602
a(n) is the maximal number of squares that can be formed from n points in the plane.
- Expansion of square of g.f. for A051573.A051603
Expansion of square of g.f. for A051573.
- a(n) = (3*n+4)!!!/4!!!.A051604
a(n) = (3*n+4)!!!/4!!!.
- a(n) = (3*n+5)!!!/5!!!.A051605
a(n) = (3*n+5)!!!/5!!!.
- a(n) = (3*n+6)!!!/6!!!, related to A032031 ((3*n)!!! triple factorials).A051606
a(n) = (3*n+6)!!!/6!!!, related to A032031 ((3*n)!!! triple factorials).
- a(n) = (3*n+7)!!!/7!!!.A051607
a(n) = (3*n+7)!!!/7!!!.
- a(n) = (3*n+8)!!!/8!!!.A051608
a(n) = (3*n+8)!!!/8!!!.
- a(n) = (3*n+9)!!!/9!!!, related to A032031 ((3*n)!!! triple factorials).A051609
a(n) = (3*n+9)!!!/9!!!, related to A032031 ((3*n)!!! triple factorials).
- Monotonic subsequence of A051169.A051610
Monotonic subsequence of A051169.