Sequences
392,541 sequences
- T(2n,n+1), T given by A026747.A026861
T(2n,n+1), T given by A026747.
- T(2n,n+2), T given by A026747.A026862
T(2n,n+2), T given by A026747.
- T(2n,n+3), T given by A026747.A026863
T(2n,n+3), T given by A026747.
- T(2n,n+4), T given by A026747.A026864
T(2n,n+4), T given by A026747.
- Number of labeled chain graphs.A026865
Number of labeled chain graphs.
- a(n) = T(2n+1,n+2), T given by A026747.A026866
a(n) = T(2n+1,n+2), T given by A026747.
- T(2n+1,n+3), T given by A026747.A026867
T(2n+1,n+3), T given by A026747.
- T(2n+1,n+4), T given by A026747.A026868
T(2n+1,n+4), T given by A026747.
- a(n) = T(n,m) + T(n,m+1) + ... + T(n,n), m=[ (n+1)/2 ], T given by A026747.A026869
a(n) = T(n,m) + T(n,m+1) + ... + T(n,n), m=[ (n+1)/2 ], T given by A026747.
- T(2n,n-4), T given by A026758.A026870
T(2n,n-4), T given by A026758.
- T(2n,n-3), T given by A026758.A026871
T(2n,n-3), T given by A026758.
- T(2n,n+1), T given by A026758.A026872
T(2n,n+1), T given by A026758.
- T(2n,n+2), T given by A026758.A026873
T(2n,n+2), T given by A026758.
- T(2n,n+3), T given by A026758.A026874
T(2n,n+3), T given by A026758.
- T(2n,n+4), T given by A026758.A026875
T(2n,n+4), T given by A026758.
- T(2n+1, n+1), T given by A026758.A026876
T(2n+1, n+1), T given by A026758.
- T(2n+1,n+2), T given by A026758.A026877
T(2n+1,n+2), T given by A026758.
- a(n) = T(2n+1,n+3), T given by A026758.A026878
a(n) = T(2n+1,n+3), T given by A026758.
- T(2n+1,n+4), T given by A026758.A026879
T(2n+1,n+4), T given by A026758.
- a(n) = T(n,m) + T(n,m+1) + ... + T(n,n), m=[ (n+1)/2 ], T given by A026758.A026880
a(n) = T(n,m) + T(n,m+1) + ... + T(n,n), m=[ (n+1)/2 ], T given by A026758.
- T(2n,n-4), T given by A026769.A026881
T(2n,n-4), T given by A026769.
- T(2n,n-3), T given by A026769.A026882
T(2n,n-3), T given by A026769.
- T(2n,n+1), T given by A026769.A026883
T(2n,n+1), T given by A026769.
- T(2n,n+2), T given by A026769.A026884
T(2n,n+2), T given by A026769.
- T(2n,n+3), T given by A026769.A026885
T(2n,n+3), T given by A026769.
- T(2n,n+4), T given by A026769.A026886
T(2n,n+4), T given by A026769.
- T(2n+1,n+1), T given by A026769.A026887
T(2n+1,n+1), T given by A026769.
- T(2n+1,n+2), T given by A026769.A026888
T(2n+1,n+2), T given by A026769.
- T(2n+1,n+3), T given by A026769.A026889
T(2n+1,n+3), T given by A026769.
- T(2n+1,n+4), T given by A026769.A026890
T(2n+1,n+4), T given by A026769.
- a(n) = T(n,m) + T(n,m+1) + ... + T(n,n), m=[ (n+1)/2 ], T given by A026769.A026891
a(n) = T(n,m) + T(n,m+1) + ... + T(n,n), m=[ (n+1)/2 ], T given by A026769.
- T(2n,n-4), T given by A026780.A026892
T(2n,n-4), T given by A026780.
- T(2n,n-3), T given by A026780.A026893
T(2n,n-3), T given by A026780.
- T(2n,n+1), T given by A026780.A026894
T(2n,n+1), T given by A026780.
- T(2n,n+2), T given by A026780.A026895
T(2n,n+2), T given by A026780.
- T(2n,n+3), T given by A026780.A026896
T(2n,n+3), T given by A026780.
- T(2n,n+4), T given by A026780.A026897
T(2n,n+4), T given by A026780.
- a(n) = Sum_{k=0..n} (n-k+1)^k.A026898
a(n) = Sum_{k=0..n} (n-k+1)^k.
- T(2n+1,n+2), T given by A026780.A026899
T(2n+1,n+2), T given by A026780.
- T(2n+1,n+3), T given by A026780.A026900
T(2n+1,n+3), T given by A026780.
- T(2n+1,n+4), T given by A026780.A026901
T(2n+1,n+4), T given by A026780.
- a(n) = T(n,m) + T(n,m+1) + ... + T(n,n), m=[ (n+1)/2 ], T given by A026780.A026902
a(n) = T(n,m) + T(n,m+1) + ... + T(n,n), m=[ (n+1)/2 ], T given by A026780.
- a(n) is the number of multisets S of positive integers satisfying E(S)=n, where E = 2nd elementary symmetric function.A026903
a(n) is the number of multisets S of positive integers satisfying E(S)=n, where E = 2nd elementary symmetric function.
- Number of sets S of positive integers satisfying E(S)=n, where E = 2nd elementary symmetric function.A026904
Number of sets S of positive integers satisfying E(S)=n, where E = 2nd elementary symmetric function.
- Partial sums of the partition numbers A000041 of the positive integers.A026905
Partial sums of the partition numbers A000041 of the positive integers.
- Number of sums S of distinct positive integers satisfying S <= n.A026906
Number of sums S of distinct positive integers satisfying S <= n.
- Triangular array T read by rows (9-diamondization of Pascal's triangle). Step 1: t(n,k) = sum of 9 entries in diamond-shaped subarray of Pascal's triangle having vertices C(n,k), C(n+4,k+2), C(n+2,k), C(n+2,k+2). Step 2: T(n,k) = t(n,k) - t(0,0) + 1.A026907
Triangular array T read by rows (9-diamondization of Pascal's triangle). Step 1: t(n,k) = sum of 9 entries in diamond-shaped subarray of Pascal's triangle having vertices C(n,k), C(n+4,k+2), C(n+2,k), C(n+2,k+2). Step 2: T(n,k) = t(n,k) - t(0,0) + 1.
- a(n) = A026907(2*n, n).A026908
a(n) = A026907(2*n, n).
- a(n) = (1/2)*A026907(2*n, n).A026909
a(n) = (1/2)*A026907(2*n, n).
- a(n) = A026907(2*n, n-1).A026910
a(n) = A026907(2*n, n-1).