36055

Appears in sequences

• Smallest number containing in its binary representation substrings forming an arithmetic progression exactly of size n.at n=13A091461
• Number of length 1+3 0..n arrays with some pair in every consecutive four terms totalling exactly n.at n=17A245951
• T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with every element equal to or 1 greater than any north or southwest neighbors modulo n and the upper left element equal to 0.at n=48A267655
• Number of 4Xn arrays containing n copies of 0..4-1 with every element equal to or 1 greater than any north or southwest neighbors modulo 4 and the upper left element equal to 0.at n=6A267656
• Number of ternary strings of length n with maximal run length three containing 1112.at n=8A269915