101312

Appears in sequences

• a(n) = Sum_{k=0..floor(n/6)} C(n-3k,3k) * 2^(n-5k).at n=14A100138
• Number of nX3 0..1 arrays with every element equal to 0, 1, 2, 3, 5, 6, 7 or 8 king-move adjacent elements, with upper left element zero.at n=7A300262
• T(n,k)=Number of nXk 0..1 arrays with every element equal to 0, 1, 2, 3, 5, 6, 7 or 8 king-move adjacent elements, with upper left element zero.at n=47A300267
• Number of minimal subsets of {1..n} containing n whose sum is greater than or equal to the sum of their complement.at n=22A326175
• a(n) is the unique solution to A323410(x) = A362185(n).at n=23A362211