|
|
A291982
|
|
a(n) = Euler(n, n+1) * 2^valuation(n+1, 2), where Euler(n, x) denotes the Euler polynomial.
|
|
2
|
|
|
1, 3, 6, 161, 380, 9251, 68922, 9718545, 24721272, 1140755269, 14712346550, 1678097074579, 13104139232340, 889926827467887, 16319429252249970, 10286621696853755681, 27076409740571217392, 2427916115944458451025, 57728302956904672126062
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,2
|
|
COMMENTS
|
Conjecture: If n >= 2 is even then n*(n+1) divides a(n).
|
|
LINKS
|
|
|
FORMULA
|
a(n) = Euler(n, n+1)*2^A007814(n+1).
|
|
MAPLE
|
A291982 := n -> euler(n, n+1)*2^(padic[ordp](n+1, 2)):
|
|
MATHEMATICA
|
Table[2^IntegerExponent[n+1, 2] EulerE[n, n+1], {n, 1, 15}]
|
|
PROG
|
(Python)
from sympy import euler
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|