50526

Appears in sequences

• a(n) = a(n-1) + a(n-2) + n, a(0) = a(1) = 1.at n=20A030119
• Number of ways to arrange 5 indistinguishable points on an n X n X n triangular grid so that no three points are in the same row or diagonal.at n=6A194477
• T(n,k) = number of ways to arrange k indistinguishable points on an n X n X n triangular grid so that no three points are in the same row or diagonal.at n=61A194480
• Number of occurrences of k in the list of transitions t(j), j <= n!-1, of interchanges a(t(j)) <-> a(t(j)+1) created by Knuth's "Algorithm T" (Plain change transitions) to generate all permutations of n distinct elements, written as a triangle T(m,k), m = n-1 >= 1, k <= m.at n=29A321668