editing
approved
editing
approved
With offset 1, a strong divisibility sequence, that is, gcd(a(n), a(m)) = a(gcd(n, m)) for all positive integers n and m. - ~~~_Michael Somos_, Dec 30 2016
approved
editing
editing
approved
With offset 1, a strong divisibility sequence, that is, gcd(a(n), a(m)) = a(gcd(n, m)) for all positive integers n and m. - ~~~
G.f. = 2 + 20*x + 210*x^2 + 2520*x^3 + 34650*x^4 + 540540*x^5 + ...
approved
editing
proposed
approved
editing
proposed
H. W. Gould, Harris Kwong, Jocelyn Quaintance, On Certain Sums of Stirling Numbers with Binomial Coefficients, J. Integer Sequences, 18 (2015), #15.9.6.
H. W. Gould, Harris Kwong, Jocelyn Quaintance, <a href="https://cs.uwaterloo.ca/journals/JIS/VOL18/Kwong/kwong9.html">On Certain Sums of Stirling Numbers with Binomial Coefficients</a>, J. Integer Sequences, 18 (2015), #15.9.6.
proposed
editing
editing
proposed
a(n) ~ 2^(n+7/2)*n^(n+3)/(3*exp(n)). - Ilya Gutkovskiy, Aug 17 2016
proposed
editing
editing
proposed