119750400

Appears in sequences

• Number of labeled cyclic groups with n elements.at n=11A034381
• a(n) = 3*n!.at n=11A052560
• E.g.f. 1/((1-x)(1-x^4)).at n=11A052614
• Expansion of e.g.f. 3*x^3/(1-x).at n=11A052619
• E.g.f. (1-x)/(1-x-x^5).at n=11A052627
• Expansion of e.g.f. (2-x-2*x^2)/((1-x)*(1-2*x^2)).at n=10A052636
• E.g.f. 3x(1+x-x^2)/(1-x).at n=11A052637
• Expansion of e.g.f. 1/(1-x^3-x^4).at n=11A052697
• a(n) = (n^2-1)*n!/3.at n=9A090672
• Expansion of e.g.f.: -1/(1+x-x^3).at n=11A109582
• a(2) = 1, a(3)=3; for n >= 4, a(n) = (n-2)!*Stirling_2(n,n-1)/2 = n!/4.at n=10A133799
• Unsigned third column (k=2) of triangle A136656 divided by 4.at n=8A136659
• A091137(n) / A001316(n) .at n=10A165641
• A091137(n) / A001316(n) .at n=11A165641
• a(1) =1; for n>=1: a(n) = product of numbers k <= sigma(n) such that k is not equal to sigma(d) for any divisor d of n where sigma = A000203.at n=8A206033
• Number of stretching pairs in all permutations in S_n.at n=10A216119
• Number of n-length words w over a 9-ary alphabet {a1,a2,...,a9} such that #(w,a1) >= #(w,a2) >= ... >= #(w,a9) >= 1, where #(w,x) counts the letters x in word w.at n=3A226888
• Partial products of A265111.at n=17A265125
• Number of 9-ary heaps on n elements.at n=13A273696
• Lexicographically least strictly increasing sequence such that, for any n>0, Sum_{k=1..n} a(k) can be computed without carries in factorial base.at n=32A279732