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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A118604 a(n) = a(n-1) mod 13 + a(n-2) mod 8, with a(0) = 0 and a(1) = 1. 0
0, 1, 1, 2, 3, 5, 8, 13, 0, 5, 5, 10, 15, 4, 11, 15, 5, 12, 17, 8, 9, 9, 10, 11, 13, 3, 8, 11, 11, 14, 4, 10, 14, 3, 9, 12, 13, 4, 9, 13, 1, 6, 7, 13, 7, 12, 19, 10, 13, 2, 7, 9, 16, 4, 4, 8, 12, 12, 16, 7, 7, 14, 8, 14, 1, 7, 8, 15, 2, 9, 11, 12, 15, 6, 13, 6, 11, 17, 7, 8, 15, 2, 9, 11, 12 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,4

LINKS

Table of n, a(n) for n=0..84.

FORMULA

a(n) = a(n-1) mod 13 + a(n-2) mod 8, with a(0) = 0 and a(1) = 1.

MATHEMATICA

a[0] = 0; a[1] = 1; a[n_] := a[n] = Mod[a[n - 1], 13] + Mod[a[n - 2], 8] aout = Table[a[n], {n, 0, 100}]

CROSSREFS

Cf. A000045.

Sequence in context: A018149 A152909 A328597 * A261694 A287533 A072123

Adjacent sequences:  A118601 A118602 A118603 * A118605 A118606 A118607

KEYWORD

nonn

AUTHOR

Roger L. Bagula, May 17 2006

EXTENSIONS

Edited by Michel Marcus, Jan 30 2013

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 1 10:13 EDT 2021. Contains 346385 sequences. (Running on oeis4.)