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.

A060584 Compare ultimate and penultimate digits of n base 3, i.e., 0 if n mod 3 = floor(n/3) mod 3, 1 otherwise; also 0 if (n mod 9) is a multiple of 4, 1 otherwise.

Table of values

n a(n)
0 0
1 1
2 1
3 1
4 0
5 1
6 1
7 1
8 0
9 0
10 1
11 1
12 1
13 0
14 1
15 1
16 1
17 0
18 0
19 1
20 1
21 1
22 0
23 1
24 1
25 1
26 0
27 0
28 1
29 1
30 1
31 0
32 1
33 1
34 1
35 0
36 0
37 1
38 1
39 1
40 0
41 1
42 1
43 1
44 0
45 0
46 1
47 1
48 1
49 0
50 1
51 1
52 1
53 0
54 0
55 1
56 1
57 1
58 0
59 1
60 1
61 1
62 0
63 0
64 1
65 1
66 1
67 0
68 1
69 1
70 1
71 0
72 0
73 1
74 1
75 1
76 0
77 1
78 1
79 1
80 0
81 0
82 1
83 1
84 1
85 0
86 1
87 1
88 1
89 0
90 0
91 1
92 1
93 1
94 0
95 1
96 1
97 1
98 0
99 0
100 1
101 1
102 1
103 0
104 1

List of values

[0, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 1, 0, 1]