1377495072

Appears in sequences

• a(1) = 6; for n > 0, a(n+1) = a(n) * (sum of digits of a(n)).at n=7A047898
• a(n) = floor(n*3^(n/2)).at n=31A128443
• The number of descents over all functions f:{1,2,...,n}->{1,2,...,n}.at n=8A226998
• Triangle T(n,m) for the number of ways to put n stones into an m X n square grid such that each of the m rows contains at least one stone.at n=43A259051
• a(n) = Sum_{k=0..n} k^2 * 2^(n-k) * binomial(n,k).at n=16A383136