122880

Appears in sequences

• Number of paraffins.at n=29A006009
• a(1) = 2, a(n) = sigma(a(n-1)).at n=15A007497
• Quadruple factorial numbers n!!!!: a(n) = n*a(n-4).at n=20A007662
• a(n) = 2^(n*(n-1)/2)*n!.at n=5A011266
• A convolution triangle of numbers obtained from A036070.at n=21A030526
• Expansion of (-1+1/(1-4*x)^4)/(16*x); related to A038846.at n=6A036070
• Triangle whose (i,j)-th entry is binomial(i,j)*6^(i-j)*8^j.at n=19A038262
• Triangle whose (i,j)-th entry is binomial(i,j)*8^(i-j)*6^j.at n=16A038284
• Triangle giving a(n,k) = number of k-colored labeled graphs with n nodes.at n=14A046860
• Triangle giving a(n,k) = number of k-colored labeled graphs with n nodes.at n=13A046860
• a(n) = 4^n * n!.at n=5A047053
• a(0)=0, a(1)=1, a(n) = n*2^(n-2) for n >= 2.at n=15A057711
• a(0) = 1; a(n) = LCM(n, sum{k=0 to n-1}[a(k)]).at n=10A057827
• McKay-Thompson series of class 20F for Monster.at n=31A058555
• 15-almost primes (generalization of semiprimes).at n=6A069276
• Numbers of the form 5*2^n or 5*3*2^n; a(n) = 5*A029744(n).at n=28A070004
• Binary expansion is 1xx100...0 where xx = 00 or 11.at n=27A070876
• Smallest k > n such that there are exactly n pairs (x,y) (1 <= x <= y <= k) solutions of the equation: phi(xy)=sigma(x)+sigma(y).at n=35A071780
• a(n) = the least positive integer k such that b(k) = n, where b(k) (A076526) is defined by b(k) = r * max{e_1,...,e_r} if k = p_1^e_1 *...* p_r^e_r is the canonical prime factorization of k.at n=38A076745
• a(i) = the number of occurrences of 9's in the palindromic compositions of n=2*i-1 = the number of occurrences of 10's in the palindromic compositions of n=2*i.at n=12A079862