1836172800

Appears in sequences

• a(n+1) = (n-1)*a(n) + n*n!.at n=10A006157
• a(1)=1. a(n+1) = n!/lcm(a(1),a(2),...,a(n)).at n=23A131120
• Triangle read by rows: T(n,k) = value of (d^2n/dx^2n) (tan^(2k)(x)/cos(x)) at the point x = 0.at n=26A151775
• a(n) is the greatest possible length of a circular sequence on n symbols such that: no two adjacent symbols are the same, any group of n adjacent symbols contains at least n-1 different symbols, and all groups of n adjacent symbols within the sequence are unique.at n=10A382411