30351
domain: N
Appears in sequences
- a(n) = a(n-2) + a(n-3) + a(n-4), with initial values a(0) = 0, a(1) = 2, a(2) = 3, a(3) = 6.at n=26A001634
- Number of n X n binary arrays with all ones connected only in a 3X3 plus 2,1 2,2 2,3 1,2 3,2.at n=8A145997
- Number of n X n binary arrays symmetric under horizontal and vertical reflection with all ones connected only in a 3 X 3 plus 2,1 2,2 2,3 1,2 3,2.at n=19A145999
- a(0)=a(1)=1, a(n) = a(n-1) + a(a(n-2) mod n).at n=43A215525
- Number of (n+2)X(3+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000000 00000001 or 00000101.at n=4A259947
- Number of (n+2)X(5+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000000 00000001 or 00000101.at n=2A259949
- T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000000 00000001 or 00000101.at n=23A259952
- T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000000 00000001 or 00000101.at n=25A259952
- Numbers k such that (2*10^k - 71)/3 is prime.at n=23A280449
- Expansion of e.g.f. 1/(1 - x*(1 + x/2)*exp(x)).at n=6A308946