244944

Appears in sequences

• E.g.f. satisfies: A(x,y) = exp(x*y*exp(x*A(x,y))).at n=42A161552
• Totally multiplicative sequence with a(p) = 2*(4p+1) = 8p+2 for prime p.at n=39A167336
• Triangle of z Transform coefficients from General Pascal [1,10,1} A142459 polynomials multiplied by factor 3^Floor[(2*k - 1)/3].at n=32A167787
• Number of sequences of length n with terms from {0,1,...,n-1} such that the sum of terms is 0 modulo n and the i-th term is not i or 2i modulo n.at n=7A173500
• Triangle T(n, k) = n!*q^k/(n-k)! if floor(n/2) > k-1 otherwise n!*q^(n-k)/k!, with q = 3, read by rows.at n=49A174377
• Triangle T(n, k) = n!*q^k/(n-k)! if floor(n/2) > k-1 otherwise n!*q^(n-k)/k!, with q = 3, read by rows.at n=50A174377
• Determinants of the (floor(n/2) - 1) X (floor(n/2) - 1) matrix whose (i,j)-th entry is the intersection number on M_{0,n} of the F-curve F_{1,1,i,n-i-2} and the divisor of the conformal blocks bundle associated to the Lie algebra sl_n, the level 1 and the n-tuple of weights omega_j^n.at n=14A174421
• A triangle whose rows add up to the numerators of the Bernoulli numbers (with B(1) = 1/2). T(n, k) for n >= 0, 0 <= k <= n.at n=40A194587
• (n-1)-st elementary symmetric function of the first n terms of (3,1,2,3,1,2,3,1,2,...).at n=16A203161
• Triangular array read by rows: T(n, k) is the number of rooted forests on {1, 2, ..., n} in which one tree has been specially designated that contain exactly k trees; n >= 1, 1 <= k <= n.at n=41A225465
• T(n,k) is the number of s in {1,...,n}^n having longest contiguous subsequence with the same value of length k; triangle T(n,k), n>=1, 1<=k<=n, read by rows.at n=40A228154
• Triangular array read by rows: T(n,k) is the number of forests of rooted labeled trees such that the vertex labeled with 1 is in a component (rooted tree) of size k, n>=1, 1<=k<=n.at n=30A232055
• Triangle read by rows: terms of a binomial decomposition of 1 as Sum(k=0..n)T(n,k).at n=48A244117