The On-Line Encyclopedia of Integer Sequences (OEIS)

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

A010225

Continued fraction for sqrt(183).
(history; published version)

#23 by Joerg Arndt at Wed Dec 27 01:17:24 EST 2023

STATUS

editing

approved

#22 by Joerg Arndt at Wed Dec 27 01:17:22 EST 2023

FORMULA

a(n) = (1/90)*(-337*(n mod 6) + 38*((n+1) mod 6) + 143*((n+2) mod 6) - 67*((n+3) mod 6) + 38*((n+4) mod 6) + 413*((n+5) mod 6)) - 13*(C(2*n,n) mod 2), with n >= 0. - Paolo P. Lava, Jul 28 2009

STATUS

approved

editing

#21 by Joerg Arndt at Sun Jul 15 04:07:59 EDT 2018

STATUS

reviewed

approved

#20 by Michel Marcus at Sun Jul 15 03:41:16 EDT 2018

STATUS

proposed

reviewed

#19 by Jon E. Schoenfield at Sat Jul 14 17:32:24 EDT 2018

STATUS

editing

proposed

#18 by Jon E. Schoenfield at Sat Jul 14 17:32:21 EDT 2018

FORMULA

a(n) = (1/90)*{(-337*(n mod 6) + 38*[((n+1) mod 6]) + 143*[((n+2) mod 6]) - 67*[((n+3) mod 6]) + 38*[((n+4) mod 6]) + 413*[((n+5) mod 6]})) - 13*[(C(2*n,n) mod 2], ), with n >= 0 [From _. - _Paolo P. Lava_, Jul 28 2009]

MATHEMATICA

ContinuedFraction[Sqrt[183], 300] (* Vladimir Joseph Stephan Orlovsky, Mar 26 2011 *)

AUTHOR

N. J. A. Sloane.

STATUS

approved

editing

#17 by Ray Chandler at Thu Mar 09 16:34:03 EST 2017

STATUS

editing

approved

#16 by Ray Chandler at Thu Mar 09 16:34:00 EST 2017

LINKS

<a href="/index/Rec#order_06">Index entries for linear recurrences with constant coefficients</a>, signature (0, 0, 0, 0, 0, 1).

STATUS

approved

editing

#15 by Charles R Greathouse IV at Sun Aug 03 14:16:15 EDT 2014

MATHEMATICA

ContinuedFraction[Sqrt[183], 300] (*From _Vladimir Joseph Stephan Orlovsky, _, Mar 26 2011*)

Discussion

Sun Aug 03

14:16

OEIS Server: https://oeis.org/edit/global/2269

#14 by Russ Cox at Fri Mar 30 18:53:14 EDT 2012

FORMULA

a(n)=(1/90)*{-337*(n mod 6)+38*[(n+1) mod 6]+143*[(n+2) mod 6]-67*[(n+3) mod 6]+38*[(n+4) mod 6]+413*[(n+5) mod 6]}-13*[C(2*n,n) mod 2], with n>=0 [From _Paolo P. Lava (paoloplava(AT)gmail.com), _, Jul 28 2009]

Discussion

Fri Mar 30

18:53

OEIS Server: https://oeis.org/edit/global/262