23063040

Appears in sequences

• Triangle read by rows: T(n,k) is the number of cycle-up-down permutations of {1,2,...,n} having k excedances (0<=k<=floor(n/2)).at n=53A186368
• The slowest growing sequence that satisfies: a(1) = 1, a(n) is a multiple of n and a(n-1), and a(n) > a(n-1).at n=15A191836
• 6-quantum transitions in systems of N >= 6 spin 1/2 particles, in columns by combination indices.at n=32A213348
• Number T(n,k) of length 2n k-ary words, either empty or beginning with the first letter of the alphabet and using each letter at least once, that can be built by repeatedly inserting doublets into the initially empty word; triangle T(n,k), n>=0, 0<=k<=n, read by rows.at n=43A256116
• Triangle T(n,k) of coefficients of polynomials arising from Gaussian-weighted Chebyshev integrals.at n=30A391950