Nothing Special   »   [go: up one dir, main page]

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”).

Revisions by Peter Bala (See also Peter Bala's wiki page)

(Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing entries 1-10 | older changes
a(n) = a(n-1) + n*(n+1)*a(n-2) with a(0)=1, a(1)=1.
(history; published version)
#21 by Peter Bala at Tue Dec 10 09:10:26 EST 2024
STATUS

editing

proposed

#20 by Peter Bala at Tue Dec 10 09:10:15 EST 2024
LINKS

L. Euler, <a href="https://scholarlycommons.pacific.edu/euler-works/index.2.html123/">E123: De fractionibus continuis observationes</a>, originally published in Commentarii academiae scientiarum Petropolitanae 11, 1750, pp. 32-81, reprinted in Opera Omnia: Series 1, Volume 14, 291-349.

STATUS

proposed

editing

Decimal expansion of Buffon's constant 2/Pi.
(history; published version)
#170 by Peter Bala at Tue Dec 10 07:41:48 EST 2024
STATUS

editing

proposed

a(n) = a(n-1) + n*(n+1)*a(n-2) with a(0)=1, a(1)=1.
(history; published version)
#19 by Peter Bala at Tue Dec 10 07:41:08 EST 2024
STATUS

editing

proposed

Discussion
Tue Dec 10
08:02
Michel Marcus: link: rather https://scholarlycommons.pacific.edu/euler-works/123/ ??
#18 by Peter Bala at Tue Dec 10 07:40:43 EST 2024
COMMENTS

From Peter Bala, Dec 09 2024: (Start)

b(n) := A000246(n+2) = (n+2)!/2^(n+1) * binomial(n+1, floor((n+1)/2)) satisfies the same second-order recurrence as a(n) with the initial conditions b(0) = 1 and b(1) = 3. This leads to the finite continued fraction a(n)/b(n) = 1/(1 + 2/(1 + 6/(1 + ... + n*(n+1)/1). Letting n tend to infinity gives the continued fraction representation 1/(1 + 2/(1 + 6/(1 + ... + n*(n+1)/(1 + ...) = Pi/2 - 1, due to Euler - see paragraph 31, p. 48. (End)

LINKS

L. Euler, <a href="https://scholarlycommons.pacific.edu/euler-works/index.2.html">E123</a>, : De fractionibus continuis observationes, </a>, originally published in Commentarii academiae scientiarum Petropolitanae 11, 1750, pp. 32-81, reprinted in Opera Omnia: Series 1, Volume 14, 291-349.

FORMULA

From Peter Bala, Dec 09 2024: (Start)

b(n) := A000246(n+2) = (n+2)!/2^(n+1) * binomial(n+1, floor((n+1)/2)) satisfies the same second-order recurrence as a(n) with the initial conditions b(0) = 1 and b(1) = 3. This leads to the finite continued fraction a(n)/b(n) = 1/(1 + 2/(1 + 6/(1 + ... + n*(n+1)/1). Letting n tend to infinty gives the continued fraction representation 1/(1 + 2/(1 + 6/(1 + ... + n*(n+1)/(1 + ...) = Pi/2 - 1, due to Euler - see paragraph 31, p. 48. (End)

Decimal expansion of Buffon's constant 2/Pi.
(history; published version)
#169 by Peter Bala at Tue Dec 10 07:35:44 EST 2024
FORMULA

From Peter Bala, Dec 10 2024:(Start)

2/Pi = 1 - 1/(2 + 2/(1 + 6/(1 + 12/(1 + 20/(1 + ... + n*(n+1)/(1 + ...), a continued fraction representation due to Euler. See A346943.

Equals 1 - (1/2)*Sum_{n >= 0} A005566(n)*(-1/4)^n. (End)

STATUS

approved

editing

a(1) = 1, a(2) = 9, a(n+2) = 9*a(n+1) + (n + 1)^2*a(n).
(history; published version)
#25 by Peter Bala at Tue Dec 10 05:20:15 EST 2024
STATUS

editing

proposed

#24 by Peter Bala at Tue Dec 10 05:20:11 EST 2024
FORMULA

The behavior of a(n) for large n is given by lim_limit_{n -> oo} a(n)/b(n) = Sum_{k >= 1} (-1)^(k+1)/(k*p(k-1)*p(k)) = 1/(9 + 1^2/(9 + 2^2/(9 + 3^2/(9 + ... + n^2/(9 + ...))))) = log(2) - (1 - 1/2 + 1/3 - 1/4); the final equality follows by a result of Ramanujan (see [Berndt, Chapter 12, Entry 29]).

a(1) = 1, a(2) = 7, a(n+2) = 7*a(n+1) + (n+1)^2*a(n).
(history; published version)
#23 by Peter Bala at Tue Dec 10 05:19:25 EST 2024
STATUS

editing

proposed

a(1) = 1, a(2) = 5, a(n+2) = 5*a(n+1) + (n + 1)^2*a(n).
(history; published version)
#23 by Peter Bala at Tue Dec 10 05:16:30 EST 2024
STATUS

editing

proposed