63168

Appears in sequences

• Half the number of 3 X n binary arrays with no path of adjacent 1's or adjacent 0's from top row to bottom row.at n=6A069429
• Half the number of n X 7 binary arrays with no path of adjacent 1's or adjacent 0's from top row to bottom row.at n=1A069445
• Numbers k such that 2^k - 1 is divisible by (k-1).at n=37A087965
• Triangle read by rows: T(n,k) is number of noncrossing trees with n edges and having k nonroot nodes of degree 1.at n=38A101449
• Triangle read by rows: T(n,k) is number of noncrossing trees with n edges and having k branches.at n=42A101452
• a(n) = (n+1)*(n+2)*(n+3)*(11*n^2 + 29*n + 20)/120.at n=13A114241
• Number of permutations of 1..n with all differences of elements separated by distances 1 or 2 being respectively unique.at n=10A170808
• 2^(2p-2) modulo p^3 for p=odd primes.at n=12A216160
• (-1)^((p-1)/2)*Binomial(p-1,(p-1)/2) mod p^3 where p is the n-th prime.at n=12A224807
• Triangle of coefficients of Gaussian polynomials [2n+7,6]_q represented as finite sum of terms (1+q^2)^k*q^(g-k), where k = 0,1,...,g with g=6n+3.at n=63A267486
• Number of n X n 0..1 arrays with no element equal to more than three of its king-move neighbors and with new values introduced in order 0 sequentially upwards.at n=5A281337
• Number of nX6 0..1 arrays with no element equal to more than three of its king-move neighbors and with new values introduced in order 0 sequentially upwards.at n=5A281342
• Triangular array read by rows: T(n,0) = 2^n, T(n,k) = Sum_{i=n-k..n, j=0..i-n+k, i<>n or j<>k} T(i,j) for k > 0.at n=35A337129
• a(n) = Sum_{k=1..n} (-1)^(k-1) * binomial(floor(n/k)+4,5).at n=21A366723
• Array read by downward antidiagonals: A(n,k) = A(n-1,k) + (k+1)*A(n-1,k+1) + k*A(n-1,k-1) with A(n,0) = A(n-1,0) + A(n-1,1), A(0,k) = 1.at n=41A391886