34288
domain: N
Appears in sequences
- Mobiles (cycle rooted trees) where no branch is identical to its adjacent neighbor.at n=15A106364
- a(n) = 8*a(n-1)-14*a(n-2) for n>1; a(0) = 2; a(1) = 9.at n=6A162356
- Number of (n+1)X(3+1) 0..2 arrays colored with the sum of the maximum and minimum values of each 2X2 subblock.at n=3A236013
- Number of (n+1)X(4+1) 0..2 arrays colored with the sum of the maximum and minimum values of each 2X2 subblock.at n=2A236014
- T(n,k)=Number of (n+1)X(k+1) 0..2 arrays colored with the sum of the maximum and minimum values of each 2X2 subblock.at n=17A236018
- T(n,k)=Number of (n+1)X(k+1) 0..2 arrays colored with the sum of the maximum and minimum values of each 2X2 subblock.at n=18A236018
- Number of (n+1) X (2+1) 0..1 arrays with every 2 X 2 subblock having one or two 1s.at n=5A251320
- Number of (n+1) X (6+1) 0..1 arrays with every 2 X 2 subblock having one or two 1's.at n=1A251324
- T(n,k)=Number of (n+1)X(k+1) 0..1 arrays with every 2X2 subblock having one or two 1s.at n=22A251326
- T(n,k)=Number of (n+1)X(k+1) 0..1 arrays with every 2X2 subblock having one or two 1s.at n=26A251326
- a(n) = Sum_{d|n} 2^(d-1) * binomial(d+n/d-1,d).at n=15A357041