A071412 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A071412

A002487 mod 3.

0, 1, 1, 2, 1, 0, 2, 0, 1, 1, 0, 2, 2, 2, 0, 1, 1, 2, 1, 1, 0, 2, 2, 1, 2, 1, 2, 2, 0, 1, 1, 2, 1, 0, 2, 0, 1, 2, 1, 1, 0, 2, 2, 1, 2, 0, 1, 0, 2, 0, 1, 0, 2, 1, 2, 2, 0, 1, 1, 2, 1, 0, 2, 0, 1, 1, 0, 2, 2, 2, 0, 1, 1, 0, 2, 0, 1, 2, 1, 1, 0, 2, 2, 1, 2, 0, 1, 0, 2, 2, 0, 1, 1, 1, 0, 2, 2, 2, 0, 1, 1, 1, 0, 2, 2

(list; graph; refs; listen; history; text; internal format)

OFFSET

0,4

REFERENCES

E. Dijkstra, Selected Writings on Computing, Springer, 1982, p. 232 (sequence is called fusc).

LINKS

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

E. W. Dijkstra, An exercise for Dr. R. M. Burstall

E. W. Dijkstra, More about the function ``fusc''

PROG

(Python)

from functools import reduce

def A071412(n): return sum(reduce(lambda x, y:(x[0], (x[0]+x[1])%3) if int(y) else ((x[0]+x[1])%3, x[1]), bin(n)[-1:2:-1], (1, 0)))%3 if n else 0 # Chai Wah Wu, May 18 2023

CROSSREFS

Sequence in context: A137696 A275731 A143614 * A080884 A354452 A362450

Adjacent sequences: A071409 A071410 A071411 * A071413 A071414 A071415

KEYWORD

nonn

AUTHOR

N. J. A. Sloane, Jul 15 2002

STATUS

approved