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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A135537 Period 4: repeat [7, 5, 2, 4]. 0
 7, 5, 2, 4, 7, 5, 2, 4, 7, 5, 2, 4, 7, 5, 2, 4, 7, 5, 2, 4, 7, 5, 2, 4, 7, 5, 2, 4, 7, 5, 2, 4, 7, 5, 2, 4, 7, 5, 2, 4, 7, 5, 2, 4, 7, 5, 2, 4, 7, 5, 2, 4, 7, 5, 2, 4, 7, 5, 2, 4, 7, 5, 2, 4, 7, 5, 2, 4, 7, 5, 2, 4, 7, 5, 2, 4, 7, 5, 2, 4, 7, 5, 2, 4, 7, 5 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,1 COMMENTS Terms of the simple continued fraction of 158/(19*sqrt(365)-341). Decimal expansion of 76/101. - Paolo P. Lava, Aug 05 2009 LINKS Index entries for linear recurrences with constant coefficients, signature (1,-1,1). FORMULA a(n) = A135536(n) mod 9. O.g.f.: ((x+5)/(x^2+1)+9*(1-x))/2. a(n) = ((-1)^floor(n/2) * A010686(n+1) + 9)/2. - R. J. Mathar, Feb 23 2008 a(n) = (1/4)*{[(n+1) mod 4]+6*[(n+2) mod 4]+5*[(n+3) mod 4]}. - Paolo P. Lava, Feb 25 2008 a(n) = 9/2+(5/4-(1/4)*I)*I^n+(5/4+(1/4)*I)*(-I)^n. - Paolo P. Lava, Jul 17 2008 From Wesley Ivan Hurt, Jul 08 2016: (Start) a(n) = a(n-1) - a(n-2) + a(n-3) for n>2, a(n) = a(n-4) for n>3. a(n) = A021408(n) for n>1. (End) MAPLE seq(op([7, 5, 2, 4]), n=0..50); # Wesley Ivan Hurt, Jul 08 2016 MATHEMATICA Flatten[Table[{7, 5, 2, 4}, {20}]] (* Harvey P. Dale, Jun 22 2011 *) PROG (MAGMA) &cat [[7, 5, 2, 4]^^30]; // Wesley Ivan Hurt, Jul 08 2016 CROSSREFS Cf. A010686, A010693, A021408, A135536. Sequence in context: A318172 A070404 A258370 * A212038 A335863 A112545 Adjacent sequences:  A135534 A135535 A135536 * A135538 A135539 A135540 KEYWORD nonn,easy AUTHOR Paul Curtz, Feb 22 2008 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 August 18 02:34 EDT 2022. Contains 356204 sequences. (Running on oeis4.)