login
This site is supported by donations 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)). 0
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; internal format)
OFFSET

1,3

FORMULA

For n >= 1, a(4n+2) = 8, a(4n+3) = 7, a(4n+4) = 9, a(4n+5) = 10.

CROSSREFS

Cf. A006530.

Sequence in context: A010075 A010074 A116918 * A121369 A125727 A112337

Adjacent sequences:  A116914 A116915 A116916 * A116918 A116919 A116920

KEYWORD

easy,nonn

AUTHOR

Leroy Quet Feb 26 2006

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 23:53 EST 2012. Contains 205860 sequences.