Sequences
392,541 sequences
- a(0) = 1; for n > 0, a(n) = n!*4^n/2.A051711
a(0) = 1; for n > 0, a(n) = n!*4^n/2.
- Numerator of b(n)-b(n+1), where b(n) = n/((n+1)(n+2)) = A026741/A045896.A051712
Numerator of b(n)-b(n+1), where b(n) = n/((n+1)(n+2)) = A026741/A045896.
- Denominator of b(n)-b(n+1), where b(n) = n/((n+1)(n+2)) = A026741/A045896.A051713
Denominator of b(n)-b(n+1), where b(n) = n/((n+1)(n+2)) = A026741/A045896.
- Numerators of table a(n,k) read by antidiagonals: a(0,k) = 1/(k+1), a(n+1,k) = (k+1)*(a(n,k) - a(n,k+1)), n >= 0, k >= 0.A051714
Numerators of table a(n,k) read by antidiagonals: a(0,k) = 1/(k+1), a(n+1,k) = (k+1)*(a(n,k) - a(n,k+1)), n >= 0, k >= 0.
- Denominators of table a(n,k) read by antidiagonals: a(0,k) = 1/(k+1), a(n+1,k) = (k+1)(a(n,k)-a(n,k+1)), n >= 0, k >= 0.A051715
Denominators of table a(n,k) read by antidiagonals: a(0,k) = 1/(k+1), a(n+1,k) = (k+1)(a(n,k)-a(n,k+1)), n >= 0, k >= 0.
- Numerators of Bernoulli twin numbers C(n).A051716
Numerators of Bernoulli twin numbers C(n).
- 1, followed by denominators of first differences of Bernoulli numbers (B(i)-B(i-1)).A051717
1, followed by denominators of first differences of Bernoulli numbers (B(i)-B(i-1)).
- Numerators of column 2 of table described in A051714/A051715.A051718
Numerators of column 2 of table described in A051714/A051715.
- Denominators of column 2 of table described in A051714/A051715.A051719
Denominators of column 2 of table described in A051714/A051715.
- Numerators of column 3 of table described in A051714/A051715.A051720
Numerators of column 3 of table described in A051714/A051715.
- Denominators of column 3 of table described in A051714/A051715.A051721
Denominators of column 3 of table described in A051714/A051715.
- Numerators of row 4 of table described in A051714/A051715.A051722
Numerators of row 4 of table described in A051714/A051715.
- Denominators of row 4 of table described in A051714/A051715.A051723
Denominators of row 4 of table described in A051714/A051715.
- Numerator of n/12.A051724
Numerator of n/12.
- Denominator of n/12.A051725
Denominator of n/12.
- Numerator of n*(n-1)*(n-2)/720.A051726
Numerator of n*(n-1)*(n-2)/720.
- Denominator of n(n-1)(n-2)/720.A051727
Denominator of n(n-1)(n-2)/720.
- Smallest number at distance 2n from nearest prime.A051728
Smallest number at distance 2n from nearest prime.
- Smallest number at distance 2n+1 from nearest prime.A051729
Smallest number at distance 2n+1 from nearest prime.
- Distance from A051650(n) to nearest prime.A051730
Distance from A051650(n) to nearest prime.
- Triangle read by rows: T(n, k) = 1 if k divides n, T(n, k) = 0 otherwise, for 1 <= k <= n.A051731
Triangle read by rows: T(n, k) = 1 if k divides n, T(n, k) = 0 otherwise, for 1 <= k <= n.
- Number of rounds of shuffling required to restore a deck of n cards to its original order: shuffling is done by keeping first card, putting second at end of deck, keeping next, putting next at end and so on.A051732
Number of rounds of shuffling required to restore a deck of n cards to its original order: shuffling is done by keeping first card, putting second at end of deck, keeping next, putting next at end and so on.
- Numbers n such that A051732(n) = n-1.A051733
Numbers n such that A051732(n) = n-1.
- a(n) = Sum_{i=0..n-1} (-1)^i * min(i+1,n-i) * a(i), a(0)=1.A051734
a(n) = Sum_{i=0..n-1} (-1)^i * min(i+1,n-i) * a(i), a(0)=1.
- Binomial coefficients C(n,k) such that C(n,k)-1 and C(n,k)+1 are twin primes and 2<=k<=floor(n/2).A051735
Binomial coefficients C(n,k) such that C(n,k)-1 and C(n,k)+1 are twin primes and 2<=k<=floor(n/2).
- Number of 3 X n (0,1)-matrices with no consecutive 1's in any row or column.A051736
Number of 3 X n (0,1)-matrices with no consecutive 1's in any row or column.
- Number of 4 X n (0,1)-matrices with no consecutive 1's in any row or column.A051737
Number of 4 X n (0,1)-matrices with no consecutive 1's in any row or column.
- Number of rooted 2-dimensional polyominoes with n pentagonal cells, with no symmetries removed.A051738
Number of rooted 2-dimensional polyominoes with n pentagonal cells, with no symmetries removed.
- Primes of the form (k!)^2 + 1.A051739
Primes of the form (k!)^2 + 1.
- Partial sums of A007584.A051740
Partial sums of A007584.
- Associated with a chi-inequality greedy algorithm.A051741
Associated with a chi-inequality greedy algorithm.
- Associated with a chi-inequality greedy algorithm.A051742
Associated with a chi-inequality greedy algorithm.
- a(n) = (1/24)*n*(n + 5)*(n^2 + n + 6).A051743
a(n) = (1/24)*n*(n + 5)*(n^2 + n + 6).
- a(n) = n*(n+1)*(n^2+5*n+18)/24.A051744
a(n) = n*(n+1)*(n^2+5*n+18)/24.
- a(n) = n*(n^4 + 10*n^3 + 35*n^2 + 50*n + 144)/120.A051745
a(n) = n*(n^4 + 10*n^3 + 35*n^2 + 50*n + 144)/120.
- a(n) = n(n+7)(n+1)(n^2+2n+12)/120.A051746
a(n) = n(n+7)(n+1)(n^2+2n+12)/120.
- a(n) = n*(n+1)*(n+2)*(n^2+7*n+32)/120.A051747
a(n) = n*(n+1)*(n+2)*(n^2+7*n+32)/120.
- Number of character table entries of the symmetric group S_n which are < 0.A051748
Number of character table entries of the symmetric group S_n which are < 0.
- Number of character table entries of the symmetric group S_n which are > 0.A051749
Number of character table entries of the symmetric group S_n which are > 0.
- Primes whose cubes lack zeros.A051750
Primes whose cubes lack zeros.
- Cubes arising in A051750.A051751
Cubes arising in A051750.
- Number of n X n (real) {0,1}-matrices having determinant A003432(n).A051752
Number of n X n (real) {0,1}-matrices having determinant A003432(n).
- Number of n X n (-1,0,1)-matrices having maximum determinant (=A003433(n)).A051753
Number of n X n (-1,0,1)-matrices having maximum determinant (=A003433(n)).
- Consider problem of placing N queens on an n X n board so that each queen attacks precisely 1 other. Sequence gives maximal number of queens.A051754
Consider problem of placing N queens on an n X n board so that each queen attacks precisely 1 other. Sequence gives maximal number of queens.
- Consider problem of placing N queens on an n X n board so that each queen attacks precisely 2 others. Sequence gives maximal number of queens.A051755
Consider problem of placing N queens on an n X n board so that each queen attacks precisely 2 others. Sequence gives maximal number of queens.
- Consider the problem of placing N queens on an n X n board so that each queen attacks precisely 3 others. Sequence gives maximal number of queens.A051756
Consider the problem of placing N queens on an n X n board so that each queen attacks precisely 3 others. Sequence gives maximal number of queens.
- Consider problem of placing A051754(n) queens on an n X n board so that each queen attacks precisely 1 other. Sequence gives number of solutions up to square symmetry.A051757
Consider problem of placing A051754(n) queens on an n X n board so that each queen attacks precisely 1 other. Sequence gives number of solutions up to square symmetry.
- Consider problem of placing A051755(n) queens on an n X n board so that each queen attacks precisely 2 others. Sequence gives number of solutions up to square symmetry.A051758
Consider problem of placing A051755(n) queens on an n X n board so that each queen attacks precisely 2 others. Sequence gives number of solutions up to square symmetry.
- Consider the problem of placing A051756(n) queens on an n X n board so that each queen attacks precisely 3 others. Sequence gives number of solutions up to square symmetry.A051759
Consider the problem of placing A051756(n) queens on an n X n board so that each queen attacks precisely 3 others. Sequence gives number of solutions up to square symmetry.
- Numbers that are simultaneously a sum of distinct factorials and of the form a^b with b >= 3.A051760
Numbers that are simultaneously a sum of distinct factorials and of the form a^b with b >= 3.