199781

Appears in sequences

• Triangle read by rows: T(n,k) number of ways of partitioning the (n+5)-element multiset {1,1,1,1,1,1,2,3,...,n} into exactly k nonempty parts, n >= 0 and 1 <= k <= n + 5.at n=84A291120
• a(n) = Sum_{k=1..n} gcd(k, n)^4.at n=20A343498