124340

Appears in sequences

• Number of binary strings of length n with equal numbers of 00000 and 01011 substrings.at n=18A164186
• Number of nX2 0..2 arrays with adjacent row and column sums unequal.at n=5A202925
• Number of nX6 0..2 arrays with adjacent row and column sums unequal.at n=1A202929
• T(n,k)=Number of nXk 0..2 arrays with adjacent row and column sums unequal.at n=22A202931
• T(n,k)=Number of nXk 0..2 arrays with adjacent row and column sums unequal.at n=26A202931
• a(n) = largest k for which A155043(k) < A262508(n); a(n) = A262509(n) + A262909(n).at n=8A263081
• a(n) = largest k for which A155043(k) < A262508(n); a(n) = A262509(n) + A262909(n).at n=6A263081
• a(n) = largest k for which A155043(k) < A262508(n); a(n) = A262509(n) + A262909(n).at n=1A263081
• a(n) = largest k for which A155043(k) < A262508(n); a(n) = A262509(n) + A262909(n).at n=5A263081
• a(n) = largest k for which A155043(k) < A262508(n); a(n) = A262509(n) + A262909(n).at n=14A263081
• a(n) = largest k for which A155043(k) < A262508(n); a(n) = A262509(n) + A262909(n).at n=4A263081
• a(n) = largest k for which A155043(k) < A262508(n); a(n) = A262509(n) + A262909(n).at n=7A263081
• a(n) = largest k for which A155043(k) < A262508(n); a(n) = A262509(n) + A262909(n).at n=12A263081
• a(n) = largest k for which A155043(k) < A262508(n); a(n) = A262509(n) + A262909(n).at n=9A263081
• a(n) = largest k for which A155043(k) < A262508(n); a(n) = A262509(n) + A262909(n).at n=11A263081
• a(n) = largest k for which A155043(k) < A262508(n); a(n) = A262509(n) + A262909(n).at n=10A263081
• a(n) = largest k for which A155043(k) < A262508(n); a(n) = A262509(n) + A262909(n).at n=3A263081
• a(n) = largest k for which A155043(k) < A262508(n); a(n) = A262509(n) + A262909(n).at n=13A263081
• a(n) = largest k for which A155043(k) < A262508(n); a(n) = A262509(n) + A262909(n).at n=2A263081
• a(n) = largest k for which A155043(k) < A262508(n); a(n) = A262509(n) + A262909(n).at n=0A263081