188160

Appears in sequences

• Triangle of coefficients in expansion of (4+7x)^n.at n=23A013625
• Triangle whose (i,j)-th entry is binomial(i,j)*7^(i-j)*4^j.at n=25A038270
• a(n) = phi(Fibonacci(n)).at n=28A065449
• Triangle, read by rows, of Stirling numbers of first kind, S1(n,k), multiplied by k^k, for n >= 1, 1<=k<=n.at n=24A105196
• Fib(n)*n^3*(binomial(2*n, n))^2/(n+1).at n=4A119696
• Partition number array, called M31(4), related to A049352(n,m)= |S1(4;n,m)| (generalized Stirling triangle).at n=49A144354
• Triangle T(n,m) = coefficient of x^n in expansion of (x^2*cotan(x))^m = sum(n>=m, T(n,m) x^n * m!^2/n!^2).at n=23A199542
• Triangle by rows, generated from the odd integers and related to A000165.at n=39A208057
• Composite numbers m such that Sum_{i=1..k} (p_i/(p_i+1)) + Product_{i=1..k} (p_i/(p_i-1)) is an integer, where p_i are the k prime factors of m (with multiplicity).at n=30A230110
• Triangle read by rows, T(n,k) = sum(j=0..2*(n-k), A254882(n-k,j)*k^j /(n-k)!), n>=0, 0<=k<=n.at n=48A254883
• Numbers k such that A051378(k) > 2*k and A333926(k) <= 2*k.at n=3A349284
• Triangle read by rows. T(n, k) = binomial(n, k) * n! / (n - k + 1)! if k >= 1, if k = 0 then T(n, k) = k^n. T(n, k) for 0 <= k <= n.at n=42A350266
• Triangle read by rows. The Faulhaber numbers. F(0, k) = 1 and otherwise F(n, k) = (n + 1)!*(-1)^(k+1)*Sum_{j=0..floor((k-1)/2)} C(2*k-2*j, k+1)*C(2*n+1, 2*j+1) * Bernoulli(2*n-2*j) / (k - j).at n=33A354042