191520

Appears in sequences

• Powers of rooted tree enumerator.at n=41A000439
• Differences of 0: 6!*Stirling2(n,6).at n=7A000920
• Largest number in n-th row of triangle A019538.at n=8A002869
• Triangle of numbers T(n,k) = k!*Stirling2(n,k) read by rows (n >= 1, 1 <= k <= n).at n=33A019538
• Number of identity bracelets with n labeled beads of 4 colors.at n=5A032339
• a(n) = n*(3*n+1)*(n+2)!/24.at n=6A037960
• Number of primitive (aperiodic) words of length n which contain exactly six different symbols.at n=7A056271
• Palindromes using exactly six different symbols.at n=15A056457
• Palindromes using exactly six different symbols.at n=14A056457
• Number of primitive (aperiodic) palindromes using exactly six different symbols.at n=14A056467
• Number of primitive (aperiodic) palindromes using exactly six different symbols.at n=15A056467
• Number of periodic palindromes using exactly six different symbols.at n=14A056492
• Number of primitive (period n) periodic palindromes using exactly six different symbols.at n=14A056502
• Numbers k such that sigma(k) > 4*k.at n=30A068404
• Numbers k such that phi(k) = 2*tau(k)^2.at n=38A068564
• a(n) = lcm_{k=1..n} (prime(k) + 1).at n=12A085272
• a(n) = lcm_{k=1..n} (prime(k) + 1).at n=11A085272
• T(n, k) = Sum_{j=0..n-k} (-1)^j*binomial(n - k + 1, j)*(n - k + 1 - j)^n. Triangle read by rows, T(n, k) for 1 <= k <= n.at n=30A090582
• a(n) is the smallest number x such that floor(sigma(sigma(x))/x) = n or the A098219(x) quotient equals n.at n=16A098221
• Triangle read by rows: T(n,h)/(n-1), where T is the array in A101819.at n=26A101820