168070

Appears in sequences

• Triangle of coefficients in expansion of (1+7x)^n.at n=40A013614
• Numbers of form 7^i*10^j, with i, j >= 0.at n=22A025632
• Triangle whose (i,j)-th entry is binomial(i,j)*7^(i-j).at n=40A027466
• Triangle whose (i,j)-th entry is binomial(i,j)*7^(i-j)*7^j.at n=17A038273
• Triangle whose (i,j)-th entry is binomial(i,j)*7^(i-j)*7^j.at n=18A038273
• Triangle read by rows: T(n,k) = number of labeled endofunctions on n points with k fixed points.at n=40A055134
• Triangle: signed version of A055134.at n=40A137370
• a(n) = binomial(n+4, 4)*7^n.at n=4A139641
• A triangular sequence in which the Prime[n]^(2*n) is treated like a variable expansion: (1-Prime[n])^(2*n) with the base Prime[0] is defined as one (in the Goldbach tradition) to lower the coefficients: t(n,m)=(-1)^m*Prime[n]^(2*n - m)*Binomial[2*n, m].at n=20A141024
• Triangular array read by rows. T(n,k) is the number of cycles in the digraph representation of all functions f:{1,2,...,n}->{1,2,...,n} that have length k; 1<=k<=n.at n=23A225213
• a(n) = n*(n + 7)*(n + 14)*(n + 21)/24.at n=35A264447
• Triangle read by rows: T(0,0) = 1; T(n,k) = T(n-1,k) + 7 * T(n-2,k-1) for k = 0..floor(n/2). T(n,k)=0 for n or k < 0.at n=46A317016
• Infinitary weird numbers (A306984) whose number of divisors is not a power of 2.at n=14A335936
• Triangle read by rows: T(n, k) = n^k * n! * [x^k][y^n]((sec(y) + tan(y)) * exp(x*y)).at n=32A376878