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.

A349360 Number of positive integer pairs (s,t), with s,t <= n and s <= t such that either both s and t divide n or both do not.

Table of values

n a(n)
1 1
2 3
3 4
4 7
5 9
6 13
7 18
8 20
9 27
10 31
11 48
12 42
13 69
14 65
15 76
16 81
17 123
18 99
19 156
20 126
21 163
22 181
23 234
24 172
25 259
26 263
27 286
28 274
29 381
30 289
31 438
32 372
33 445
34 475
35 506
36 423
37 633
38 605
39 640
40 564
41 783
42 631
43 864
44 762
45 801
46 913
47 1038
48 796
49 1087
50 1011
51 1138
52 1102
53 1329
54 1117
55 1336
56 1212
57 1441

List of values

[1, 3, 4, 7, 9, 13, 18, 20, 27, 31, 48, 42, 69, 65, 76, 81, 123, 99, 156, 126, 163, 181, 234, 172, 259, 263, 286, 274, 381, 289, 438, 372, 445, 475, 506, 423, 633, 605, 640, 564, 783, 631, 864, 762, 801, 913, 1038, 796, 1087, 1011, 1138, 1102, 1329, 1117, 1336, 1212, 1441]