20736

Appears in sequences

• Fourth powers: a(n) = n^4.at n=12A000583
• Powers of 12.at n=4A001021
• Highly powerful numbers: numbers with record value of the product of the exponents in prime factorization (A005361).at n=20A005934
• a(n) = a(n-1) + a(n-3) + a(n-4), a(0) = a(1) = a(2) = 1, a(3) = 2.at n=22A006498
• Smallest k such that sigma(x) = k has exactly n solutions.at n=39A007368
• a(n) = denominator of sum_{k=1..n} k^(-4).at n=3A007480
• Squared Fibonacci numbers: a(n) = F(n)^2 where F = A000045.at n=12A007598
• a(n) = floor(n/4)*floor((n+1)/4)*floor((n+2)/4)*floor((n+3)/4).at n=48A008233
• a(n) = Product_{i=0..7} floor((n+i)/8).at n=28A009694
• Nearest integer to (n/2)^4.at n=24A011863
• Triangle of coefficients in expansion of (1+12x)^n.at n=14A013619
• a(n) = 12^(3*n + 1).at n=1A013750
• a(n) = 12^(5*n + 4).at n=0A013865
• Expansion of (1 + 2*x)/(1 - 2*x)^3.at n=8A014477
• Squares of even Fibonacci numbers.at n=4A014729
• a(n) = (2*n)^4.at n=6A016744
• a(n) = (3*n)^4.at n=4A016768
• a(n) = (4*n)^2.at n=36A016802
• a(n) = (4*n)^4.at n=3A016804
• a(n) = (5*n + 2)^4.at n=2A016876