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.

A087509 Number of k such that (k*n) == 2 (mod 3) for 0 <= k <= n.

Table of values

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

List of values

[0, 0, 1, 0, 1, 2, 0, 2, 3, 0, 3, 4, 0, 4, 5, 0, 5, 6, 0, 6, 7, 0, 7, 8, 0, 8, 9, 0, 9, 10, 0, 10, 11, 0, 11, 12, 0, 12, 13, 0, 13, 14, 0, 14, 15, 0, 15, 16, 0, 16, 17, 0, 17, 18, 0, 18, 19, 0, 19, 20, 0, 20, 21, 0, 21, 22, 0, 22, 23, 0, 23, 24, 0, 24, 25, 0, 25, 26, 0, 26, 27, 0, 27, 28, 0, 28]