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.

A060236 If n mod 3 = 0 then a(n) = a(n/3), otherwise a(n) = n mod 3.

Table of values

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

List of values

[1, 2, 1, 1, 2, 2, 1, 2, 1, 1, 2, 1, 1, 2, 2, 1, 2, 2, 1, 2, 1, 1, 2, 2, 1, 2, 1, 1, 2, 1, 1, 2, 2, 1, 2, 1, 1, 2, 1, 1, 2, 2, 1, 2, 2, 1, 2, 1, 1, 2, 2, 1, 2, 2, 1, 2, 1, 1, 2, 2, 1, 2, 1, 1, 2, 1, 1, 2, 2, 1, 2, 2, 1, 2, 1, 1, 2, 2, 1, 2, 1, 1, 2, 1, 1, 2, 2, 1, 2, 1, 1, 2, 1, 1, 2, 2, 1, 2, 2, 1, 2, 1, 1, 2, 2]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.