1481760

Appears in sequences

• Triangle of coefficients in expansion of (6+7x)^n.at n=24A013627
• Triangle whose (i,j)-th entry is binomial(i,j)*7^(i-j)*6^j.at n=24A038272
• Sequence terms are generated by solving the n x n linear algebra problem [H]x = b, where b is the unit vector. Only xn, the last unknown is used.at n=10A124261
• Unsigned member s=2 of a family of generalizations of the (signed) Lah triangle A008297. All numbers divided by 2.at n=29A136657
• Number of 2-step self-avoiding walks on an n X n X n X n 4-cube summed over all starting positions.at n=20A188785
• Triangular array: T(n,k) = sqrt(C(n-1,k-1)*C(n-1,k)*C(n,k+1)* C(n+1,k+1)*C(n+1,k)*C(n,k-1)), where C(n,k) = binomial(n,k).at n=31A197208
• Triangular array: T(n,k) = sqrt(C(n-1,k-1)*C(n-1,k)*C(n,k+1)* C(n+1,k+1)*C(n+1,k)*C(n,k-1)), where C(n,k) = binomial(n,k).at n=32A197208
• Numbers n such that there are three distinct triples (k, k+n, k+2n) of squares.at n=31A222154
• Triangle read by rows: T(n,k) is the number of n-bead bracelets with exactly k different colored beads.at n=51A273891
• E.g.f.: exp(x^2/(x-1)).at n=10A293117
• E.g.f.: exp(-x^2/(1+x)).at n=10A293122
• Triangle read by rows: T(n,k) is the number of chiral pairs of color loops of length n with exactly k different colors.at n=51A305541
• T(n,k) is the number of non-equivalent distinguishing colorings of the cycle on n vertices with exactly k colors (k>=1). Regular triangle read by rows, n >= 1, 1 <= k <= n.at n=51A309651
• Triangle T(n,k) defined by Sum_{k=1..n} T(n,k)*u^k*x^n/n! = Product_{j>0} ( exp(x^j/(1 - x^j)) )^u.at n=40A338864
• Triangle read by rows: T(n, k) is the denominator of the probability of winning a certain game while playing optimally.at n=61A370399
• Expansion of e.g.f. 1 / (1 - x * (exp(x^2) - 1))^2.at n=9A375664