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!)
A076441 Let u(1) = u(2) = u(3) = 1; u(n) = sign(u(n-1)-u(n-2))*u(n-3), then a(n) = 1+u(n). 1
2, 2, 2, 1, 0, 0, 1, 0, 2, 1, 2, 2, 1, 0, 0, 1, 0, 2, 1, 2, 2, 1, 0, 0, 1, 0, 2, 1, 2, 2, 1, 0, 0, 1, 0, 2, 1, 2, 2, 1, 0, 0, 1, 0, 2, 1, 2, 2, 1, 0, 0, 1, 0, 2, 1, 2, 2, 1, 0, 0, 1, 0, 2, 1, 2, 2, 1, 0, 0, 1, 0, 2, 1, 2, 2, 1, 0, 0, 1, 0, 2, 1, 2, 2, 1, 0, 0, 1, 0, 2, 1, 2, 2, 1, 0, 0, 1, 0, 2, 1, 2, 2, 1, 0, 0 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
FORMULA
a(n) is a 9-periodic sequence with period (1, 0, 0, 1, 0, 2, 1, 2, 2)
MATHEMATICA
PadRight[{2}, 120, {1, 2, 2, 1, 0, 0, 1, 0, 2}] (* Harvey P. Dale, Nov 30 2018 *)
CROSSREFS
Sequence in context: A131079 A334889 A078336 * A319289 A124747 A334888
KEYWORD
nonn
AUTHOR
Benoit Cloitre, Nov 24 2002
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 19 03:30 EDT 2024. Contains 371782 sequences. (Running on oeis4.)