Sequences
392,541 sequences
- Sum{T(i,n-i): i=0,1,...,n}, array T given by A047010.A047011
Sum{T(i,n-i): i=0,1,...,n}, array T given by A047010.
- T(n,n), array T given by A047010.A047012
T(n,n), array T given by A047010.
- T(n,n-1), array T given by A047010.A047013
T(n,n-1), array T given by A047010.
- T(n,n-2), array T given by A047010.A047014
T(n,n-2), array T given by A047010.
- T(n,n-3), array T given by A047010.A047015
T(n,n-3), array T given by A047010.
- T(n,n+1), array T given by A047010.A047016
T(n,n+1), array T given by A047010.
- T(n,n+2), array T given by A047010.A047017
T(n,n+2), array T given by A047010.
- T(n,n+3), array T given by A047010.A047018
T(n,n+3), array T given by A047010.
- T(2n,n), array T given by A047010.A047019
T(2n,n), array T given by A047010.
- Array T read by diagonals: T(h,k)=number of paths consisting of steps from (0,0) to (h,k) such that each step has length 1 directed up or right and no step touches the line y=2x/3 unless x=0 or x=h.A047020
Array T read by diagonals: T(h,k)=number of paths consisting of steps from (0,0) to (h,k) such that each step has length 1 directed up or right and no step touches the line y=2x/3 unless x=0 or x=h.
- a(n) = Sum_{i=0..n} T(i,n-i) where T is given by A047020.A047021
a(n) = Sum_{i=0..n} T(i,n-i) where T is given by A047020.
- T(n,n), array T given by A047020.A047022
T(n,n), array T given by A047020.
- T(n,n-1), array T given by A047020.A047023
T(n,n-1), array T given by A047020.
- T(n,n-2), array T given by A047020.A047024
T(n,n-2), array T given by A047020.
- T(n,n-3), array T given by A047020.A047025
T(n,n-3), array T given by A047020.
- T(n,n+1), array T given by A047020.A047026
T(n,n+1), array T given by A047020.
- T(n,n+2), array T given by A047020.A047027
T(n,n+2), array T given by A047020.
- T(n,n+3), array T given by A047020.A047028
T(n,n+3), array T given by A047020.
- T(2n,n), array T given by A047020.A047029
T(2n,n), array T given by A047020.
- Array T read by diagonals: T(h,k)=number of paths consisting of steps from (0,0) to (h,k) such that each step has length 1 directed up or right and no step touches the line y=x/4 unless x=0 or x=h.A047030
Array T read by diagonals: T(h,k)=number of paths consisting of steps from (0,0) to (h,k) such that each step has length 1 directed up or right and no step touches the line y=x/4 unless x=0 or x=h.
- Sum{T(i,n-i): i=0,1,...,n}, array T as in A047030.A047031
Sum{T(i,n-i): i=0,1,...,n}, array T as in A047030.
- T(n,n), array T as in A047030.A047032
T(n,n), array T as in A047030.
- T(n,n-1), array T as in A047030.A047033
T(n,n-1), array T as in A047030.
- T(n,n-2), array T as in A047030.A047034
T(n,n-2), array T as in A047030.
- T(n,n-3), array T as in A047030.A047035
T(n,n-3), array T as in A047030.
- T(n,n+1), array T as in A047030.A047036
T(n,n+1), array T as in A047030.
- T(n,n+2), array T as in A004730.A047037
T(n,n+2), array T as in A004730.
- T(n,n+3), array T as in A047030.A047038
T(n,n+3), array T as in A047030.
- T(2n,n), array T as in A047030.A047039
T(2n,n), array T as in A047030.
- Array T read by diagonals: T(h,k)=number of paths consisting of steps from (0,0) to (h,k) such that each step has length 1 directed up or right and no step touches the line y=3x/4 unless x=0 or x=h.A047040
Array T read by diagonals: T(h,k)=number of paths consisting of steps from (0,0) to (h,k) such that each step has length 1 directed up or right and no step touches the line y=3x/4 unless x=0 or x=h.
- Sum{T(i,n-i): i=0,1,...,n}, array T as in A047040; Sum{T(i,n-i): i=0,1,...,n}, array T given by A047050.A047041
Sum{T(i,n-i): i=0,1,...,n}, array T as in A047040; Sum{T(i,n-i): i=0,1,...,n}, array T given by A047050.
- T(n,n), array T as in A047040; T(n,n), array T given by A047050.A047042
T(n,n), array T as in A047040; T(n,n), array T given by A047050.
- T(n,n-1), array T as in A047040; T(n-1,n), array T given by A047050.A047043
T(n,n-1), array T as in A047040; T(n-1,n), array T given by A047050.
- T(n,n-2), array T as in A047040; T(n-2,n), array T given by A047050.A047044
T(n,n-2), array T as in A047040; T(n-2,n), array T given by A047050.
- T(n,n-3), array T as in A047040; T(n-3,n), array T given by A047050.A047045
T(n,n-3), array T as in A047040; T(n-3,n), array T given by A047050.
- T(n,n+1), array T as in A047040; T(n+1,n), array T given by A047050.A047046
T(n,n+1), array T as in A047040; T(n+1,n), array T given by A047050.
- T(n,n+2), array T as in A047040; T(n+2,n), array T given by A047050.A047047
T(n,n+2), array T as in A047040; T(n+2,n), array T given by A047050.
- T(n,n+3), array T as in A047040; T(n+3,n), array T given by A047050.A047048
T(n,n+3), array T as in A047040; T(n+3,n), array T given by A047050.
- T(2n,n), array T as in A047040.A047049
T(2n,n), array T as in A047040.
- Array T read by diagonals: T(h,k)=number of paths consisting of steps from (0,0) to (h,k) such that each step has length 1 directed up or right and no step touches the line y=4x/3 unless x=0 or x=h.A047050
Array T read by diagonals: T(h,k)=number of paths consisting of steps from (0,0) to (h,k) such that each step has length 1 directed up or right and no step touches the line y=4x/3 unless x=0 or x=h.
- Prime alternating tangle types (of knots) with n crossings.A047051
Prime alternating tangle types (of knots) with n crossings.
- Number of Abelian subgroups of Chevalley group A_n(2) (the group of nonsingular n X n matrices over GF(2)).A047052
Number of Abelian subgroups of Chevalley group A_n(2) (the group of nonsingular n X n matrices over GF(2)).
- a(n) = 4^n * n!.A047053
a(n) = 4^n * n!.
- Duplicate of A052562.A047054
Duplicate of A052562.
- Quintuple factorial numbers: a(n) = Product_{k=0..n-1} (5*k + 2).A047055
Quintuple factorial numbers: a(n) = Product_{k=0..n-1} (5*k + 2).
- Quintuple factorial numbers: Product_{k=0..n-1} (5*k+3).A047056
Quintuple factorial numbers: Product_{k=0..n-1} (5*k+3).
- Number of configurations of linear chains in a cubic lattice.A047057
Number of configurations of linear chains in a cubic lattice.
- a(n) = 6^n * n!.A047058
a(n) = 6^n * n!.
- T(2n,n), array T given by A047050.A047059
T(2n,n), array T given by A047050.
- Array T read by diagonals: T(h,k)=number of paths consisting of steps from (0,0) to (h,k) such that each step has length 1 directed up or right and no step touches the line y=5x/3 unless x=0 or x=h.A047060
Array T read by diagonals: T(h,k)=number of paths consisting of steps from (0,0) to (h,k) such that each step has length 1 directed up or right and no step touches the line y=5x/3 unless x=0 or x=h.