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!)
A116917 a(1)=a(2)=1. a(n) = A006530(a(n-1)) + A006530(a(n-2)). 1
1, 1, 2, 3, 5, 8, 7, 9, 10, 8, 7, 9, 10, 8, 7, 9, 10, 8, 7, 9, 10, 8, 7, 9, 10, 8, 7, 9, 10, 8, 7, 9, 10, 8, 7, 9, 10, 8, 7, 9, 10, 8, 7, 9, 10, 8, 7, 9, 10, 8, 7, 9, 10, 8, 7, 9, 10, 8, 7, 9, 10, 8, 7, 9, 10, 8, 7, 9, 10, 8, 7, 9, 10, 8, 7, 9, 10, 8, 7, 9, 10, 8, 7, 9, 10, 8, 7, 9, 10, 8, 7, 9, 10, 8 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
LINKS
FORMULA
For n >= 1, a(4n+2) = 8, a(4n+3) = 7, a(4n+4) = 9, a(4n+5) = 10.
From Chai Wah Wu, Sep 06 2019: (Start)
a(n) = a(n-1) - a(n-2) + a(n-3) for n > 8.
G.f.: x*(-5*x^7 - x^6 - 4*x^5 - 3*x^4 - x^3 - 2*x^2 - 1)/((x - 1)*(x^2 + 1)). (End)
a(n) = (17+cos(n*Pi/2)+3*sin(n*Pi/2))/2 for n>=6. - Wesley Ivan Hurt, May 07 2021
MATHEMATICA
PadRight[{1, 1, 2, 3, 5}, 100, {10, 8, 7, 9}] (* Harvey P. Dale, Jun 09 2013 *)
CROSSREFS
Cf. A006530.
Sequence in context: A355702 A116918 A271621 * A354184 A121369 A284172
KEYWORD
easy,nonn
AUTHOR
Leroy Quet, Feb 26 2006
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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 22:17 EDT 2024. Contains 371964 sequences. (Running on oeis4.)