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.

A074794 Number of numbers k <= n such that tau(k) == 1 (mod 3) where tau(k) = A000005(k) is the number of divisors of k.

Table of values

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

List of values

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