2177280

Appears in sequences

• a(n+1) = a(n)/n! if n! divides a(n) else a(n)*n!.at n=9A008338
• a(n) = (n+3)*n!/2.at n=8A038720
• Triangle read by rows: T(n,k) = n!*k.at n=41A051683
• Number of pairs of sequences of cardinality at least 2.at n=9A052520
• Expansion of e.g.f. (1-x)/(1-x-x^3).at n=9A052557
• E.g.f. 1/(1-x-x^5).at n=9A052632
• Expansion of e.g.f. (1+x-x^3)/((1-x)*(1-x^2)).at n=9A052687
• Expansion of e.g.f. (1+x-x^2)/((1-x)*(1-x^2)).at n=9A052689
• Product of factorials of the digits of n.at n=39A066459
• Triangle T(n,k) defined by Sum_{k=1..n} T(n,k)*u^k*t^n/n! = ((1+t)*(1+t^2)*(1+t^3)...)^u.at n=45A075525
• a(n) = Product_{k|n} k!.at n=8A098710
• Cumulative product of sextuple factorial A085158.at n=9A114796
• The first four terms of the sequence are doubled, then those numbers are tripled and then those numbers are quadrupled, etc.at n=34A115425
• Product of the nonzero digital products of all the numbers 1 to n (a 'total digital-product factorial' in base 10).at n=12A131451
• Triangle read by rows: T(n,k) = (n + 1)*(n + k)!.at n=19A143085
• Numbers n such that sigma(x) = n has more solutions x than any smaller n.at n=33A145899
• Triangle read by rows: T(n,k) is the number of permutations of {1,2,...,n} in which k is an excedance (n >= 2, 1 <= k <= n-1). An excedance of a permutation p is a value j such that p(j) > j.at n=39A152883
• a(n) = A002952(n) + A002953(n).at n=20A180277
• a(n) = 6^(n-1) * n! * Catalan(n-1).at n=4A221955
• a(n) = n! * Sum_{d in D(n+1)} (-1)^(d+1)*(n+1)/d, D(n) the divisors of n.at n=9A265024