|
|
|
|
#30 by Alois P. Heinz at Fri Apr 02 17:57:56 EDT 2021
|
|
|
|
#29 by Chai Wah Wu at Fri Apr 02 17:49:40 EDT 2021
|
|
|
|
#28 by Chai Wah Wu at Fri Apr 02 17:49:36 EDT 2021
|
|
|
|
#27 by Chai Wah Wu at Fri Apr 02 17:49:26 EDT 2021
|
| PROG
|
(Python)
from sympy import bernoulli, gcd
def A050932(n):
q = bernoulli(n).q
return q//gcd(q, n+1) # Chai Wah Wu, Apr 02 2021
|
| STATUS
|
approved
editing
|
|
|
|
#26 by Peter Luschny at Wed Feb 17 12:34:07 EST 2021
|
|
|
|
#25 by Peter Luschny at Wed Feb 17 06:35:53 EST 2021
|
|
|
|
#24 by Peter Luschny at Wed Feb 17 06:14:28 EST 2021
|
| COMMENTS
|
Apparently a(n) = denominator(Sum_{k=0..n-1} (-1)^(n-k+1)*E1(n, k+1)/binomial(n, k+1)), where E1(n, k) denotes the first-order Eulerian numbers A123125.. - _Peter Luschny_, Feb 17 2021
|
|
|
|
#23 by Peter Luschny at Wed Feb 17 05:22:20 EST 2021
|
| CROSSREFS
|
Cf. A050925, A000367/A002445, A027641/A027642, A002882, A003245, A127187, A127188, A242179, A106831, A000142, A123125.
|
|
|
Discussion
|
Wed Feb 17
| 05:27
| Peter Luschny: It's not that I deleted the cfs, the system erased them all after I appended a new one with some hidden '<' .
|
|
|
|
#22 by Peter Luschny at Wed Feb 17 05:21:27 EST 2021
|
| COMMENTS
|
Apparently a(n) = denominator(Sum_{k=0..n-1} (-1)^(n-k+1)*E1(n, k+1)/binomial(n, k+1)), where E1(n, k) denotes the first-order Eulerian numbers A123125.
|
| CROSSREFS
|
Cf. A050925, A000367/A002445, A027641/A027642, A002882, A003245, A127187, A127188, A242179, A106831, A000142.
Cf. A123125.
|
| STATUS
|
approved
editing
|
|
|
|
#21 by OEIS Server at Mon Oct 01 06:56:51 EDT 2018
|
| LINKS
|
Antti Karttunen, <a href="/A050932/b050932_1.txt">Table of n, a(n) for n = 0..20000</a> (terms 0..200 from N. J. A. Sloane)
|
|
|
|