The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A105398 A simple "Fractal Jump Sequence" (FJS). 5
 4, 8, 4, 8, 4, 8, 4, 8, 4, 8, 4, 8, 4, 8, 4, 8, 4, 8, 4, 8, 4, 8, 4, 8, 4, 8, 4, 8, 4, 8, 4, 8, 4, 8, 4, 8, 4, 8, 4, 8, 4, 8, 4, 8, 4, 8, 4, 8, 4, 8, 4, 8, 4, 8, 4, 8, 4, 8, 4, 8, 4, 8, 4, 8, 4, 8, 4, 8, 4, 8, 4, 8, 4, 8, 4, 8, 4, 8, 4, 8, 4, 8, 4, 8, 4, 8, 4, 8, 4, 8, 4, 8, 4, 8, 4, 8, 4, 8, 4, 8, 4, 8, 4, 8, 4 (list; graph; refs; listen; history; text; internal format)
 OFFSET 4,1 COMMENTS See A105397 for definition of Fractal Jump Sequence. Continued fraction expansion of (4+3*sqrt(2))/2. - Bruno Berselli, Nov 09 2011 Period 2: repeat [4, 8]. - Wesley Ivan Hurt, Feb 12 2017 LINKS Index entries for linear recurrences with constant coefficients, signature (0,1). FORMULA G.f.: -4*x^4*(1+2*x) / ( (x-1)*(1+x) ). - R. J. Mathar, Jul 07 2011 a(n) = a(-n) = a(n-2) = 2*(3-(-1)^n) = 2^((5-(-1)^n)/2). - Bruno Berselli, Nov 09 2011 MAPLE A105398:=n->2*(3-(-1)^n): seq(A105398(n), n=0..150); # Wesley Ivan Hurt, Feb 12 2017 MATHEMATICA PadRight[{}, 110, {4, 8}] (* Harvey P. Dale, Nov 09 2011 *) PROG (Sage) [power_mod(2, n, 12)for n in range(2, 108)] # Zerinvary Lajos, Nov 03 2009 (Maxima) makelist(if evenp(n) then 4 else 8, n, 0, 30); /* Martin Ettl, Nov 12 2012 */ CROSSREFS Cf. A105397. Sequence in context: A019838 A155970 A010713 * A005883 A055026 A336818 Adjacent sequences:  A105395 A105396 A105397 * A105399 A105400 A105401 KEYWORD nonn,base,easy AUTHOR Eric Angelini, May 01 2005 STATUS approved

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

Last modified January 23 15:15 EST 2021. Contains 340385 sequences. (Running on oeis4.)