The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A326577

(Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing entries 1-10 | older changes

A326577

a(n) = (2*n - 1) / A326478(2*n - 1).
(history; published version)

#19 by OEIS Server at Fri Apr 26 03:18:14 EDT 2024

LINKS

Amiram Eldar, <a href="/A326577/b326577_1.txt">Table of n, a(n) for n = 1..10000</a>

#18 by Alois P. Heinz at Fri Apr 26 03:18:14 EDT 2024

STATUS

proposed

approved

Discussion

Fri Apr 26

03:18

OEIS Server: Installed first b-file as b326577.txt.

#17 by Amiram Eldar at Fri Apr 26 02:41:51 EDT 2024

STATUS

editing

proposed

#16 by Amiram Eldar at Fri Apr 26 02:40:29 EDT 2024

LINKS

Amiram Eldar, <a href="/A326577/b326577_1.txt">Table of n, a(n) for n = 1..10000</a>

#15 by Amiram Eldar at Fri Apr 26 02:34:49 EDT 2024

MATHEMATICA

a[n_] := Module[{b = BernoulliB[2*n -2]}, (2* n - 1) * Denominator[b] / ((2 * n - 1) * Denominator[(2 * n - 1) * b])]; Array[a, 100] (* Amiram Eldar, Apr 26 2024 *)

STATUS

approved

editing

#14 by Peter Luschny at Fri Jul 19 06:20:24 EDT 2019

STATUS

editing

approved

#13 by Peter Luschny at Fri Jul 19 06:20:21 EDT 2019

FORMULA

a(n) = gcd((2*n-1)*N(2*n-2), D(2*n-2)), with N(k)/D(k) = B(k) the k-th Bernoulli number.

MAPLE

A326577 := n -> (2*n - 1)/A326478(2*n - 1): seq(A326577(n), n=1..72);

db := n -> denom(bernoulli(n)): nb := n -> numer(bernoulli(n)):

a := n -> igcd(db(2*n-2), (2*n-1)*nb(2*n-2)): seq(A326577a(n), n=1..72);

STATUS

approved

editing

#12 by Sean A. Irvine at Wed Jul 17 17:39:46 EDT 2019

STATUS

reviewed

approved

#11 by Felix Fröhlich at Wed Jul 17 14:40:23 EDT 2019

STATUS

proposed

reviewed

#10 by Michel Marcus at Wed Jul 17 14:21:59 EDT 2019

STATUS

editing

proposed