200704

Appears in sequences

• a(n) = Product_{j=0..5} floor((n+j)/6).at n=46A008881
• Triangle of coefficients in expansion of (4+7x)^n.at n=29A013625
• a(n) = (11*n + 8)^2.at n=40A017486
• a(n) = (12*n + 4)^2.at n=37A017570
• Numbers of form 4^i*7^j, with i, j >= 0.at n=35A025619
• a(n+1) is smallest square > a(n) having no digits in common with a(n), with a(0) = 0.at n=30A030288
• Numbers of form 7^i*8^j with i, j >= 0, sorted.at n=25A036566
• Triangle whose (i,j)-th entry is binomial(i,j)*7^(i-j)*4^j.at n=34A038270
• Third column of triangle A055864.at n=6A055070
• a(0)=1, a(1)=6, a(n)=49*8^(n-2) if n>=2.at n=6A055847
• Coefficient triangle for certain polynomials.at n=23A055864
• Smallest n-digit square starting with 2.at n=4A067472
• 14-almost primes (generalization of semiprimes).at n=25A069275
• Numbers whose sum of exponents is equal to the product of prime factors.at n=14A071174
• Number of forests with two connected components in the complete graph K_{n}.at n=7A083483
• a(n) = n^2*4^n/4.at n=7A086952
• a(n) = (2*n+1)*2^floor((n+1)/2).at n=24A097578
• Interleave n+1 and 2n+1 and take binomial transform.at n=15A098156
• Triangle read by rows: T(n, m) = number of forests with n nodes and m labeled trees. Also number of forests with exactly n - m edges on n labeled nodes.at n=29A105599
• Number of domino tilings of a 7-pillow of order n.at n=9A112839