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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A110897 Let fw[n_] := Mod[n, 3], fb[n_] := Mod[n, 2]; a(n) = a(n-a(n-1))+1+fw[n-a(n-2)]-fb[n-a(n-1)]. 1
0, 1, 3, 3, 2, 5, 2, 7, 1, 4, 3, 3, 4, 5, 5, 5, 5, 5, 6, 7, 7, 8, 6, 5, 7, 9, 6, 8, 9, 8, 7, 10, 8, 11, 7, 10, 9, 10, 12, 10, 9, 10, 9, 8, 12, 12, 9, 15, 11, 14, 10, 11, 10, 8, 12, 10, 12, 14, 14, 12, 13, 13, 15, 14, 12, 8, 15, 13, 12, 16, 14, 15, 15, 16, 17, 17, 14, 14, 14, 10, 15, 18, 14, 18 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

COMMENTS

A modular chaotic recursive sequence with three functional parts.

LINKS

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

MATHEMATICA

fw[n_] := Mod[n, 3] fb[n_] := Mod[n, 2] f[0] = 0; f[1] = 1; f[n_] := f[n] = f[n - f[n - 1]] + 1 + fw[n - f[n - 2]] - fb[n - f[n - 1]] a = Table[f[n], {n, 0, 200}]

CROSSREFS

Sequence in context: A151848 A238238 A117937 * A116644 A166462 A328177

Adjacent sequences:  A110894 A110895 A110896 * A110898 A110899 A110900

KEYWORD

nonn

AUTHOR

Roger L. Bagula, Sep 20 2005

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 November 22 18:55 EST 2019. Contains 329410 sequences. (Running on oeis4.)