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!)
A209121 Recursive sequence: a(n) = 1+mod(abs(n-2+a(n-2)),n) + mod(abs(n-1+a(n-1)),n-1), a(0) = 1, a(1) = 1, a(2) = 1, a(3)=1, a(4)=2. 1
1, 1, 1, 1, 2, 7, 3, 9, 4, 12, 6, 17, 11, 14, 11, 24, 19, 9, 27, 17, 23, 19, 41, 37, 30, 17, 20, 36, 28, 6, 33, 8, 40, 15, 20, 34, 53, 50, 27, 37, 63, 59, 38, 53, 47, 10, 56, 19, 26, 44, 69, 62, 27, 35, 61, 41, 45, 85 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,5
LINKS
MATHEMATICA
a[0] = 1; a[1] = 1; a[2] = 1; a[3] = 1; a[4] = 2; a[n_] := a[n] = 1 + Mod[Abs[n - 2 + a[n - 2]], n] + Mod[Abs[n - 1 + a[n - 1]], n - 1]; Table[a[n], {n, 0, 100}]
CROSSREFS
Cf. A072222.
Sequence in context: A091694 A086310 A115949 * A021891 A256614 A021369
KEYWORD
nonn
AUTHOR
Roger L. Bagula, Mar 05 2012
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 23 11:35 EDT 2024. Contains 371912 sequences. (Running on oeis4.)