38413

Appears in sequences

• Number of (s(0), s(1), ..., s(n)) such that s(0) = 0, |s(i) - s(i-1)| = 1 for i = 1,2,3; |s(i) - s(i-1)| <= 1 for i >= 4, s(n) = 3; also a(n) = T(n,n-3), where T is the array defined in A026082.at n=9A026086
• Numbers n such that mu(n) + mu(n+1) + mu(n+2) + mu(n+3) + mu(n+4) + mu(n+5) + mu(n+6) = 6.at n=26A082967
• Number of ways to place zero or more nonadjacent 1,0 1,1 2,0 2,1 3,2 3,3 4,2 4,3 polyhexes in any orientation on a planar nXnXn triangular grid.at n=9A155432
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 387", based on the 5-celled von Neumann neighborhood.at n=39A271545
• Number T(n,k) of permutations of [n] where the minimal distance between elements of the same cycle equals k (k=n for the identity permutation in S_n); triangle T(n,k), n>=0, 0<=k<=n, read by rows.at n=37A276974
• Number of permutations of [n] such that the minimal distance between elements of the same cycle equals one, a(1)=1 by convention.at n=7A276975