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.

A110269 n mod 2 + n mod 3.

Table of values

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

List of values

[0, 2, 2, 1, 1, 3, 0, 2, 2, 1, 1, 3, 0, 2, 2, 1, 1, 3, 0, 2, 2, 1, 1, 3, 0, 2, 2, 1, 1, 3, 0, 2, 2, 1, 1, 3, 0, 2, 2, 1, 1, 3, 0, 2, 2, 1, 1, 3, 0, 2, 2, 1, 1, 3, 0, 2, 2, 1, 1, 3, 0, 2, 2, 1, 1, 3, 0, 2, 2, 1, 1, 3, 0, 2, 2, 1, 1, 3, 0, 2, 2, 1, 1, 3, 0, 2, 2, 1, 1, 3, 0, 2, 2, 1, 1, 3, 0, 2, 2, 1, 1, 3, 0, 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.