30698
domain: N
Appears in sequences
- Triangle T(n,k) read by rows of partially ordered sets ("posets") with n unlabeled nodes and k maximal elements (0 <= k <= n).at n=49A065066
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, -1), (-1, 0, 0), (0, -1, 1), (0, 1, 1), (1, 1, 0)}.at n=8A150482
- Number of (n+1) X (1+1) 0..3 arrays with the maximum of every 2 X 2 subblock equal.at n=2A236942
- Number of (n+1)X(3+1) 0..3 arrays with the maximum of every 2X2 subblock equal.at n=0A236944
- T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with the maximum of every 2X2 subblock equal.at n=3A236949
- T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with the maximum of every 2X2 subblock equal.at n=5A236949
- Values of n such that prime(n) does not divide any 10-digit pandigital number (i.e. any value in A050278).at n=12A292703