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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A215604 a(0)=0, a(n) = (n + a(floor(n/2))) mod 3. 0
0, 1, 0, 1, 1, 2, 1, 2, 0, 1, 0, 1, 1, 2, 1, 2, 1, 2, 1, 2, 2, 0, 2, 0, 1, 2, 1, 2, 2, 0, 2, 0, 0, 1, 0, 1, 1, 2, 1, 2, 0, 1, 0, 1, 1, 2, 1, 2, 1, 2, 1, 2, 2, 0, 2, 0, 1, 2, 1, 2, 2, 0, 2, 0, 1, 2, 1, 2, 2, 0, 2, 0, 1, 2, 1, 2, 2, 0, 2, 0, 2, 0, 2, 0, 0, 1, 0, 1, 2 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,6

LINKS

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

PROG

(Python)

TOP = 1000

a = [0]*TOP

for n in range(1, TOP):

    print a[n-1],

    a[n] = (n + a[n//2]) % 3

CROSSREFS

Cf. A010060 ((n + a(floor(n/2))) mod 2).

Cf. A051065 ((n + a(floor(n/3))) mod 2).

Cf. A053838 ((n + a(floor(n/3))) mod 3).

Sequence in context: A070088 A131851 A104886 * A139351 A285677 A036578

Adjacent sequences:  A215601 A215602 A215603 * A215605 A215606 A215607

KEYWORD

nonn,easy

AUTHOR

Alex Ratushnyak, Aug 17 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 | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 16 17:25 EST 2018. Contains 317275 sequences. (Running on oeis4.)