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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A158570 a(n) = A007814((2n-1)!! + 1). 1
 1, 2, 4, 1, 1, 2, 5, 1, 1, 2, 4, 1, 1, 2, 5, 1, 1, 2, 4, 1, 1, 2, 5, 1, 1, 2, 4, 1, 1, 2, 5, 1, 1, 2, 4, 1, 1, 2, 5, 1, 1, 2, 4, 1, 1, 2, 5, 1, 1, 2, 4, 1, 1, 2, 5, 1, 1, 2, 4, 1, 1, 2, 5, 1, 1, 2, 4, 1, 1, 2, 5, 1, 1, 2, 4, 1, 1, 2, 5, 1, 1, 2, 4, 1, 1, 2, 5, 1, 1, 2, 4, 1, 1, 2, 5, 1, 1, 2, 4, 1, 1, 2, 5, 1, 1 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS Repeats with period 8. Also the decimal expansion of the constant 124112510/99999999. - R. J. Mathar, Apr 02 2009 Terms of the simple continued fraction of 399/(5*sqrt(5595) - 99). - Paolo P. Lava, Aug 05 2009 LINKS FORMULA a(n) = 1 if n == 0,1,4,5 (mod 8),        2 if n ==     2,6 (mod 8),        4 if n ==       3 (mod 8),        5 if n ==       7 (mod 8). G.f.: -x*(1 + 2*x + 4*x^2 + x^3 + x^4 + 2*x^5 + 5*x^6 + x^7)/((x-1)*(1+x)*(x^2+1)*(x^4+1)). - R. J. Mathar, Apr 02 2009 a(n) = (1/224)*(17*(n mod 8) + 129*((n+1) mod 8) - 67*((n+2) mod 8) - 11*((n+3) mod 8) + 17*((n+4) mod 8) + 101*((n+5) mod 8) - 39*((n+6) mod 8) - 11*((n+7) mod 8)), with n >= 0. - Paolo P. Lava, Mar 30 2009 MATHEMATICA PadRight[{}, 120, {1, 2, 4, 1, 1, 2, 5, 1}] (* Harvey P. Dale, May 05 2020 *) CROSSREFS Cf. A007814, A001147. Sequence in context: A336434 A007738 A186520 * A295224 A074749 A194524 Adjacent sequences:  A158567 A158568 A158569 * A158571 A158572 A158573 KEYWORD nonn AUTHOR Vladimir Shevelev, Mar 21 2009 STATUS approved

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.

Last modified July 7 02:44 EDT 2022. Contains 355141 sequences. (Running on oeis4.)