90436

Appears in sequences

• Let u be any string of n digits from {0,1}; let f(u) = number of distinct primes, not beginning with 0, formed by permuting the digits of u to a base-2 number; then a(n) = max_u f(u).at n=23A065843
• Number of n X n arrays of squares of integers with every 3X3 subblock summing to 22.at n=1A159224
• Number of n X n arrays of squares of integers with every (n-1)X(n-1) subblock summing to 22.at n=1A159410
• Number of binary strings of length n with equal numbers of 0110 and 1001 substrings.at n=18A164177
• Number of 5-step one space at a time bishop's tours on an n X n board summed over all starting positions.at n=32A187158
• Number of permutations p of [n] such that |p(i) - p(i-1)| <= 2 and |p(i) - p(i-2)| <= 3.at n=32A333833