This site is supported by donations to The OEIS Foundation.

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A134011 Period 9: repeat [1, 2, 3, 4, 5, 4, 3, 2, 1]. 1
 1, 2, 3, 4, 5, 4, 3, 2, 1, 1, 2, 3, 4, 5, 4, 3, 2, 1, 1, 2, 3, 4, 5, 4, 3, 2, 1, 1, 2, 3, 4, 5, 4, 3, 2, 1, 1, 2, 3, 4, 5, 4, 3, 2, 1, 1, 2, 3, 4, 5, 4, 3, 2, 1, 1, 2, 3, 4, 5, 4, 3, 2, 1, 1, 2, 3, 4, 5, 4, 3, 2, 1, 1, 2, 3, 4, 5, 4, 3, 2, 1, 1, 2, 3, 4, 5 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 LINKS Vincenzo Librandi, Table of n, a(n) for n = 0..1000 Index entries for linear recurrences with constant coefficients, signature (0,0,0,0,0,0,0,0,1). FORMULA a(n) = (1/324)*{25*(n mod 9)+61*[(n+1) mod 9]+61*[(n+2) mod 9]+61*[(n+3) mod 9]+61*[(n+4) mod 9]-11*[(n+5) mod 9]-11*[(n+6) mod 9]-11*[(n+7) mod 9]-11*[(n+8) mod 9]}, with n>=0. - Paolo P. Lava, Jan 25 2008 a(n) = a(n-9) for n > 8. G.f.: (1 + x + x^2 + x^3 + x^4)^2/(1 - x^9). - Chai Wah Wu, Jun 04 2016 MAPLE A134011:=n->[1, 2, 3, 4, 5, 4, 3, 2, 1][(n mod 9)+1]: seq(A134011(n), n=0..100); # Wesley Ivan Hurt, Jun 11 2016 MATHEMATICA PadRight[{}, 81, {1, 2, 3, 4, 5, 4, 3, 2, 1}] (* Harvey P. Dale, Oct 31 2011 *) PROG (MAGMA) &cat [[1, 2, 3, 4, 5, 4, 3, 2, 1]: n in [0..8]]; // Wesley Ivan Hurt, Jun 11 2016 CROSSREFS Cf. A131974. Sequence in context: A143055 A271751 A017890 * A280913 A035343 A017880 Adjacent sequences:  A134008 A134009 A134010 * A134012 A134013 A134014 KEYWORD nonn,easy AUTHOR Paul Curtz, Jan 10 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified January 18 16:40 EST 2019. Contains 319271 sequences. (Running on oeis4.)