68308

Appears in sequences

• Let u be any string of n digits from {0,...,6}; let f(u) = number of distinct primes, not beginning with 0, formed by permuting the digits of u to a base-7 number; then a(n) = max_u f(u).at n=9A065848
• Number of 8-step one space for components leftwards or up, two space for components rightwards or down asymmetric quasi-bishop's tours (antidiagonal moves become knight moves) on an n X n board summed over all starting positions.at n=9A187612
• a(n) = a(n-1) + 3*a(n-2) -2*a(n-3) - 2*a(n-4), where a(0) = -2, a(1) = -1, a(2) = 2, a(3) = 1.at n=20A295853
• a(n) = Sum_{k=0..n} binomial(k+2,2) * binomial(2*k,2*n-2*k).at n=9A382230