login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A289289
a(n) = A005259(n) mod (n+1)^3.
1
0, 5, 19, 37, 1, 149, 1, 165, 559, 5, 1, 1373, 1, 5, 2698, 2725, 1, 581, 1, 2445, 3160, 5, 1, 8285, 1751, 5, 15139, 9677, 1, 18005, 1, 31397, 16045, 5, 13450, 2669, 1, 5, 52801, 20365, 1, 20501, 1, 65333, 59425, 5, 1, 86621, 48707, 99005, 59029, 54173, 1, 99725
OFFSET
0,2
LINKS
Eric Weisstein's World of Mathematics, Apéry Number
FORMULA
If m = n + 1 is a prime and m >= 5, a(n) = 1.
PROG
(PARI) a(n) = sum(k=0, n, (binomial(n, k)*binomial(n+k, k))^2) % (n+1)^3; \\ Michel Marcus, Jul 02 2017
CROSSREFS
Sequence in context: A255413 A031041 A029523 * A213631 A242589 A232057
KEYWORD
nonn
AUTHOR
Seiichi Manyama, Jul 01 2017
STATUS
approved