login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A116918 a(1)=a(2)=1. a(n) = A020639(a(n-1)) + A006530(a(n-2)). 0
1, 1, 2, 3, 5, 8, 7, 9, 10, 5, 10, 7, 12, 9, 6, 5, 8, 7, 9, 10, 5, 10, 7, 12, 9, 6, 5, 8, 7, 9, 10, 5, 10, 7, 12, 9, 6, 5, 8, 7, 9, 10, 5, 10, 7, 12, 9, 6, 5, 8, 7, 9, 10, 5, 10, 7, 12, 9, 6, 5, 8, 7, 9, 10, 5, 10, 7, 12, 9, 6, 5, 8, 7, 9, 10, 5, 10, 7, 12, 9, 6, 5, 8, 7, 9, 10, 5, 10, 7, 12, 9, 6, 5, 8 (list; graph; refs; listen; history; internal format)
OFFSET

1,3

FORMULA

For n >= 0, a(11n+5) = 5, a(11n+6) = 8, a(11n+7) = 7, a(11n+8) = 9, a(11n+9) = 10, a(11n+10) = 5, a(11n+11) = 10, a(11n+12) = 7, a(11n+13) = 12, a(11n+14) = 9, a(11n+15) = 6.

CROSSREFS

Cf. A006530, A020639.

Sequence in context: A065115 A010075 A010074 * A116917 A121369 A125727

Adjacent sequences:  A116915 A116916 A116917 * A116919 A116920 A116921

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 11:19 EST 2012. Contains 205769 sequences.