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!)
A174835 Sequence given by: a(0)=1, a(1)=2, and the formula a(n)=a(abs(floor((1/5)*n-a(n-2)))) for n>=2. 2

%I

%S 1,2,2,2,2,2,2,2,2,2,1,1,2,2,1,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,

%T 2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,1,1,1,1,1,2,2,1,

%U 1,2,2,2,2,2,2,2,2,2,2,2,1,1,2,2,1,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2

%N Sequence given by: a(0)=1, a(1)=2, and the formula a(n)=a(abs(floor((1/5)*n-a(n-2)))) for n>=2.

%e a(2)=a(abs(floor(2/5)-a(0))))=a(1)=2. a(3)=a(abs(-2))=2. a(4)=a(abs(-2)=2.

%e a(5)=a(abs(-1))=a(1)=2. a(6)=a(abs(1-2))=2. a(7)=a(abs(1-2))=2.

%e a(8)=a(abs(1-2))=2. a(9)=a(abs(1-2))=2. a(10)=a(2-2)=a(0)=1.

%K easy,nonn

%O 0,2

%A _Richard Choulet_, Mar 30 2010

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 September 29 22:48 EDT 2022. Contains 357092 sequences. (Running on oeis4.)