54880
domain: N
Appears in sequences
- Fourier coefficients of E_{infinity,4}.at n=38A007331
- Triangle of coefficients in expansion of (2 + 7*x)^n.at n=24A013623
- Triangle of coefficients in expansion of (4+7x)^n.at n=18A013625
- Triangle whose (i,j)-th entry is binomial(i,j)*7^(i-j)*2^j.at n=24A038268
- Triangle whose (i,j)-th entry is binomial(i,j)*7^(i-j)*4^j.at n=17A038270
- a(n) = A004017(n)/2.at n=18A045825
- Triangle read by rows: T(n,k) = Sum_{j=0..k-1} T(n,j) + Sum_{j=1..n-k} T(n-j,k), with T(0,0)=1 and T(n,k) = 0 for k > n.at n=49A059450
- a(n) is the number of nonnegative integers k less than 10^n such that the decimal representation of k lacks at least one of digits 1, 2, at least one of digits 3,4, at least one of digits 5,6 and at least one of digits 7,8,9.at n=4A126633
- A certain partition array in Abramowitz-Stegun (A-St) order.at n=35A134149
- If (a_n) is a sequence then let L(a_n)=(b_n) where b_n = a_n^2 - a_{n-1} a_{n+1}. The given sequence is the rows of the triangle obtained by computing L^2(binomial(n,k)).at n=24A140982
- Triangle of coefficients in expansion of (14 + x)^n.at n=24A147716
- Totally multiplicative sequence with a(p) = 2*(3p+1) = 6p+2 for prime p.at n=23A167335
- Numbers with prime factorization pq^3r^5.at n=28A190011
- Number of (n+2) X 9 0..2 arrays with every 3 X 3 subblock having three equal elements in a row horizontally, vertically or nw-to-se diagonally exactly three ways, and new values 0..2 introduced in row major order.at n=8A204369
- Triangular array read by rows. T(n,k) is the number of rooted labeled trees on n nodes such that the root node has degree k. n>=2, 1<=k<=n-1.at n=24A206429
- Numbers k such that digital root of k equals largest prime factor of k.at n=37A209192
- Numbers k such that the product of divisors of sigma(k) is divisible by the product of divisors of k.at n=33A219362
- Numbers x such that sigma(x)=sigma(V(x)), where sigma(x) is the sum of the divisors of x and V(x) the transform defined in A245252.at n=16A245469
- Sum of the cubes of the divisor complements of the odd proper divisors of n.at n=37A352049
- Number of chordless cycles in the n X n rook complement graph.at n=7A361185