42094
domain: N
Appears in sequences
- a(n) = a(1) + a(2) + ... + a(n-1) - a(m) for n >= 3, where m = 2*n - 3 - 2^(p+1) and p is the unique integer such that 2^p < n-1 <= 2^(p+1), with a(1) = a(2) = 1.at n=18A049884
- a(n) = floor(log(n)*2^n/n).at n=17A065613
- a(n) = round(log(n)*2^n/n).at n=17A065614
- Indices of triple-safe primes: p=prime(n) is double-safe: q=(p-1)/2, r=(q-1)/2 and s=(r-1)/2 are all prime (and q is double-safe).at n=29A075134
- Convolution of Fibonacci and Jacobsthal numbers.at n=16A094687
- Number of 6-step S, NW and NE-moving king's tours on an n X n board summed over all starting positions.at n=17A187380
- Number of (n+2)X(3+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000001 00000011 or 00000111.at n=6A260065
- Number of (n+2)X(7+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000001 00000011 or 00000111.at n=2A260069
- T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000001 00000011 or 00000111.at n=38A260070