54357
domain: N
Appears in sequences
- Smallest number of complexity n: smallest number requiring n 1's to build using +, * and ^.at n=26A003037
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (F(2), F(3), F(4), ...), t = (primes).at n=25A025111
- Number of nX3 0..1 arrays with every element unequal to 1, 2, 3, 4 or 6 king-move adjacent elements, with upper left element zero.at n=6A304592
- Number of nX7 0..1 arrays with every element unequal to 1, 2, 3, 4 or 6 king-move adjacent elements, with upper left element zero.at n=2A304596
- T(n,k)=Number of nXk 0..1 arrays with every element unequal to 1, 2, 3, 4 or 6 king-move adjacent elements, with upper left element zero.at n=38A304597
- T(n,k)=Number of nXk 0..1 arrays with every element unequal to 1, 2, 3, 4 or 6 king-move adjacent elements, with upper left element zero.at n=42A304597