344064

Appears in sequences

• a(n) = 4^(n-4)*(n-1)*(n-2)*(n-3).at n=5A006044
• Triangle of coefficients in expansion of (1+4x)^n.at n=51A013611
• Incrementally largest terms in the continued fraction for zeta(3).at n=19A033166
• Triangle whose (i,j)-th entry is binomial(i,j)*4^(i-j).at n=48A038231
• Triangle whose (n, k)-th entry is binomial(n, k)*4^(n - k)*4^k.at n=30A038234
• Triangle whose (n, k)-th entry is binomial(n, k)*4^(n - k)*4^k.at n=33A038234
• Triangle whose (i,j)-th entry is binomial(i,j)*4^(i-j)*12^j.at n=29A038242
• 4-fold convolution of A000302 (powers of 4); expansion of g.f. 1/(1-4*x)^4.at n=6A038846
• First differences of A045623.at n=17A045891
• Triangle T(n,k) of number of minimal 3-covers of a labeled n-set that cover k points of that set uniquely (k=3,..,n).at n=21A057964
• Expansion of ((1-x)/(1-2*x))^3.at n=14A058396
• Expansion of (1+3*x+4*x^2)/(1-4*x^2+4*x^4).at n=27A058582
• 16-almost primes (generalization of semiprimes).at n=8A069277
• a(n) = phi(2^n+1)/(2*n).at n=23A069925
• a(1) = 1; a(n) is the smallest multiple of a(n-1) not divisible by 10 which is greater than the digit reversal of a(n-1). In case R(a(n-1)) < a(n-1) then a(n) = 2*a(n-1).at n=14A076086
• Triangle with T(n,k)=n!*(k-1)^k/k! where 1<=k<=n.at n=32A076482
• a(n) = 4^(n-1)*Fibonacci(n).at n=8A099133
• a(n) = Tau(N), where N = the number obtained as a concatenation of 9801 with itself n times. Tau(n) = number of divisors of n.at n=17A110755
• a(n)=4a(n-2).at n=15A137480
• Array read by antidiagonals: A(n,k) = (k+1)^n*(n+k)!/n!.at n=39A152818