a(n) = P(n+1, n+1) where P(n, m) = P(n, m-1) + P(n-1, m + f(m-n)) for n < m with P(n, m) = P(n-1, m) for 0 <= m <= n and P(0, m) = 1 for m >= 0 and where f(n) = [(n mod 4) > 0].
(history;
published version)
Mersenne exponents: primes p such that 2^p - 1 is prime. Then 2^p - 1 is called a Mersenne prime.
(history;
published version)
For n >= 1, put A_n(z) = Sum_{j>=0} (n*j)!/(j!^n) * z^j and B_n(z) = Sum_{j>=0} (n*j)!/(j!^n) * z^j * (Sum_{k=1..j*n} (1/k)), and let b(n) be the largest integer for which exp(B_n(z)/(b(n)*A_n(z))) has integral coefficients. The sequence is b(n).
(history;
published version)
Discussion
Sun Sep 22
07:24
OEIS Server: Installed first b-file as b372707.txt.
Discussion
Sun Sep 22
07:24
OEIS Server: Installed first b-file as b141605.txt.
