The On-Line Encyclopedia of Integer Sequences (OEIS)

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

A338636

G.f. A(x) satisfies: 1 = A(x) - x/(A(x) - 3^2*x/(A(x) - 5^2*x/(A(x) - 7^2*x/(A(x) - 9^2*x/(A(x) - ...))))), a continued fraction relation.
(history; published version)

#14 by Vaclav Kotesovec at Thu Nov 12 12:20:00 EST 2020

STATUS

editing

approved

#13 by Vaclav Kotesovec at Thu Nov 12 12:19:53 EST 2020

FORMULA

a(n) ~ 2^(6*n + 1) * n^(2*n - 1/2) / (Pi^(2*n + 1/2) * exp(2*n)). - Vaclav Kotesovec, Nov 12 2020

STATUS

approved

editing

#12 by N. J. A. Sloane at Thu Nov 05 22:53:40 EST 2020

STATUS

proposed

approved

#11 by Paul D. Hanna at Thu Nov 05 21:05:42 EST 2020

STATUS

editing

proposed

#10 by Paul D. Hanna at Thu Nov 05 21:05:40 EST 2020

FORMULA

For n > 0, a(n) = 1 (mod 3) iff n = A191107(k) for some k >= 1 (conjecture).

For n > 0, a(n) = 2 (mod 3) iff n = A186776(k) for some k >= 2 where A186776 is the Stanley sequence S(0,2) (conjecture).

STATUS

proposed

editing

#9 by Paul D. Hanna at Thu Nov 05 16:17:14 EST 2020

STATUS

editing

proposed

#8 by Paul D. Hanna at Thu Nov 05 16:17:09 EST 2020

FORMULA

a(n) = 0 (mod 8) for n > 1 (conjecture).

STATUS

proposed

editing

#7 by Paul D. Hanna at Thu Nov 05 16:14:27 EST 2020

STATUS

editing

proposed

#6 by Paul D. Hanna at Thu Nov 05 16:14:20 EST 2020

CROSSREFS

Cf. A191107, A186776.

#5 by Paul D. Hanna at Thu Nov 05 16:13:23 EST 2020

FORMULA

For n > 0, a(n) = 2 (mod 3) iff n = A186776(k) for k >= 1 2 where A186776 is the Stanley sequence S(0,2) (conjecture).