101976

Appears in sequences

• a(n) = smallest non-palindromic k such that the Reverse and Add! trajectory of k is palindrome-free and joins the trajectory of A070788(n).at n=12A089494
• Triangle T(n, k) = A169643(n, k) - A169653(n, 1) + 1, read by rows.at n=30A169654
• Triangle T(n, k) = A169643(n, k) - A169653(n, 1) + 1, read by rows.at n=33A169654
• Triangle, read by rows, T(n, k) = binomial(n-1,k-1)*n!/k! + binomial(n-1, n-k)* n!/(n-k+1)! - n!.at n=30A169660
• Triangle, read by rows, T(n, k) = binomial(n-1,k-1)*n!/k! + binomial(n-1, n-k)* n!/(n-k+1)! - n!.at n=33A169660
• Number of nX6 0..4 arrays with each element equal to the number its horizontal and vertical neighbors equal to 2.at n=12A197059
• Number of permutations p of [n] with no fixed points and displacement of elements restricted by seven: 1 <= |p(i)-i| <= 7.at n=9A259780
• Number of derangements of a set of n elements where 2 specific elements cannot appear in each other's positions.at n=9A331007
• Square array read by antidiagonals downwards: for n >= 2, T(k,n) is the number of permutations of [k+n] that differ in every position from both the identity permutation and a permutation consisting of k 1-cycles and one n-cycle.at n=52A335391
• Irregular triangle read by rows: T(n, k) is the number of 2n-step closed walks on the square lattice having algebraic area k; n >= 0, 0 <= k <= floor(n^2/4).at n=34A352838