[go: up one dir, main page]

login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
Revision History for A040584 (Underlined text is an addition; strikethrough text is a deletion.)

Showing entries 1-10 | older changes
A040584 Continued fraction for sqrt(609).
(history; published version)
#15 by Joerg Arndt at Wed Dec 27 00:46:01 EST 2023
STATUS

editing

approved

#14 by Joerg Arndt at Wed Dec 27 00:45:59 EST 2023
FORMULA

a(n)=(1/396)*{-1510*(n mod 12)+74*[(n+1) mod 12]+272*[(n+2) mod 12]-223*[(n+3) mod 12]+41*[(n+4) mod 12]+206*[(n+5) mod 12]-124*[(n+6) mod 12]+41*[(n+7) mod 12]+305*[(n+8) mod 12]-190*[(n+9) mod 12]+8*[(n+10) mod 12]+1592*[(n+11) mod 12]}-24*[C(2*n,n) mod 2], with n>=0 [From Paolo P. Lava, May 15 2009]

STATUS

approved

editing

#13 by Ray Chandler at Fri Mar 10 14:23:27 EST 2017
STATUS

editing

approved

#12 by Ray Chandler at Fri Mar 10 14:23:24 EST 2017
LINKS

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

STATUS

approved

editing

#11 by Russ Cox at Fri Mar 30 18:53:24 EDT 2012
FORMULA

a(n)=(1/396)*{-1510*(n mod 12)+74*[(n+1) mod 12]+272*[(n+2) mod 12]-223*[(n+3) mod 12]+41*[(n+4) mod 12]+206*[(n+5) mod 12]-124*[(n+6) mod 12]+41*[(n+7) mod 12]+305*[(n+8) mod 12]-190*[(n+9) mod 12]+8*[(n+10) mod 12]+1592*[(n+11) mod 12]}-24*[C(2*n,n) mod 2], with n>=0 [From _Paolo P. Lava (paoloplava(AT)gmail.com), _, May 15 2009]

Discussion
Fri Mar 30 18:53
OEIS Server: https://oeis.org/edit/global/262
#10 by Russ Cox at Fri Mar 30 16:47:57 EDT 2012
AUTHOR

_N. J. A. Sloane (njas(AT)research.att.com)._.

Discussion
Fri Mar 30 16:47
OEIS Server: https://oeis.org/edit/global/110
#9 by T. D. Noe at Wed Sep 28 20:46:17 EDT 2011
FORMULA

a(n)=(1/396)*{-1510*(n mod 12)+74*[(n+1) mod 12]+272*[(n+2) mod 12]-223*[(n+3) mod 12]+41*[(n+4) mod 12]+206*[(n+5) mod 12]-124*[(n+6) mod 12]+41*[(n+7) mod 12]+305*[(n+8) mod 12]-190*[(n+9) mod 12]+8*[(n+10) mod 12]+1592*[(n+11) mod 12]}-24*[C(2*n,n) mod 2], with n>=0 [From Paolo P. Lava (pplpaoloplava(AT)splgmail.atcom), May 15 2009]

Discussion
Wed Sep 28 20:46
OEIS Server: https://oeis.org/edit/global/96
#8 by Russ Cox at Sun Jul 10 18:18:00 EDT 2011
LINKS

<a href="/Sindx_index/Con.html#confC">Index entries for continued fractions for constants</a>

Discussion
Sun Jul 10 18:18
OEIS Server: https://oeis.org/edit/global/31
#7 by N. J. A. Sloane at Thu Nov 11 07:34:06 EST 2010
LINKS

<a href="="/Sindx_Con.html#confC">Index entries for continued fractions for constants</a>

KEYWORD

nonn,cofr,easy,less,new

#6 by N. J. A. Sloane at Tue Jun 01 03:00:00 EDT 2010
FORMULA

a(n)=(1/396)*{-1510*(n mod 12)+74*[(n+1) mod 12]+272*[(n+2) mod 12]-223*[(n+3) mod 12]+41*[(n+4) mod 12]+206*[(n+5) mod 12]-124*[(n+6) mod 12]+41*[(n+7) mod 12]+305*[(n+8) mod 12]-190*[(n+9) mod 12]+8*[(n+10) mod 12]+1592*[(n+11) mod 12]}-24*[C(2*n,n) mod 2], with n>=0 [From Paolo P. Lava (ppl(AT)spl.at), May 15 2009]

KEYWORD

nonn,cofr,easy,less,new

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 30 04:38 EDT 2024. Contains 375526 sequences. (Running on oeis4.)