23649
domain: N
Appears in sequences
- Numbers n such that phi(reverse(n)) = sigma(n).at n=11A070835
- Triangle T(n, k) = (-1)^(n-k)*StirlingS1(n, k) + (-1)^k*StirlingS1(n, n-k) + (-1)^n*StirlingS1(n, k)*StirlingS1(n, n-k), read by rows.at n=23A155744
- Triangle T(n, k) = (-1)^(n-k)*StirlingS1(n, k) + (-1)^k*StirlingS1(n, n-k) + (-1)^n*StirlingS1(n, k)*StirlingS1(n, n-k), read by rows.at n=25A155744
- Number of (n+2)X4 binary arrays avoiding patterns 001 and 010 in rows and columns.at n=3A202610
- Number of (n+2)X6 binary arrays avoiding patterns 001 and 010 in rows and columns.at n=1A202612
- T(n,k)=Number of (n+2)X(k+2) binary arrays avoiding patterns 001 and 010 in rows and columns.at n=11A202616
- T(n,k)=Number of (n+2)X(k+2) binary arrays avoiding patterns 001 and 010 in rows and columns.at n=13A202616
- Number of unlabeled hypertrees with up to n vertices and without singleton edges.at n=12A304970
- Expansion of Product_{k>=1} 1/((1 - x^k)*(1 - x^(4*k))).at n=33A318027
- Square array T(n,k), n >= 0, k >= 0, read by antidiagonals, where T(n,k) = Sum_{j=0..n} k^j * binomial(n,j) * binomial(2*j,j).at n=40A340970
- a(n) = Sum_{k=0..n} n^k * binomial(n,k) * binomial(2*k,k).at n=4A340971