cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A094451 a(n) = A033485(n) modulo 3.

This page as a plain text file.
%I A094451 #9 Jun 09 2022 02:28:59
%S A094451 1,2,0,2,1,1,1,0,2,0,1,2,0,1,2,2,2,1,0,0,0,1,2,1,0,0,0,1,2,1,0,2,1,0,
%T A094451 2,0,1,1,1,1,1,1,1,2,0,2,1,2,0,0,0,0,0,0,0,1,2,1,0,1,2,2,2,1,0,1,2,2,
%U A094451 2,1,0,0,0,1,2,0,1,2
%N A094451 a(n) = A033485(n) modulo 3.
%C A094451 Partials sums modulo 3 of the sequence : 1, a(1), a(1), a(2), a(2), a(3), a(3), a(4), a(4), a(5), ...
%o A094451 (Python)
%o A094451 from itertools import islice
%o A094451 from collections import deque
%o A094451 def A094451_gen(): # generator of terms
%o A094451     aqueue, f, b, a = deque([2]), True, 1, 2
%o A094451     yield from (1, 2)
%o A094451     while True:
%o A094451         a = (a+b) % 3
%o A094451         yield a
%o A094451         aqueue.append(a)
%o A094451         if f: b = aqueue.popleft()
%o A094451         f = not f
%o A094451 A094451_list = list(islice(A094451_gen(),40)) # _Chai Wah Wu_, Jun 08 2022
%Y A094451 Cf. A033485.
%K A094451 easy,nonn
%O A094451 1,2
%A A094451 _Philippe Deléham_, Jun 04 2004