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.

A331503 a(n) is the number of sets modulo n which can be formed by a finite arithmetic sequence.

Table of values

n a(n)
1 1
2 3
3 7
4 15
5 31
6 42
7 99
8 119
9 193
10 218
11 463
12 340
13 807
14 682
15 849
16 1087
17 1939
18 1299
19 2775
20 1862
21 2615
22 3050
23 5107
24 2988
25 5681
26 5242
27 6439
28 5656
29 10615
30 5562
31 13083
32 9631
33 11367
34 12362
35 14153
36 10531
37 22719
38 17578
39 19361
40 16050
41 31243
42 16728
43 36207
44 24284
45 26133

List of values

[1, 3, 7, 15, 31, 42, 99, 119, 193, 218, 463, 340, 807, 682, 849, 1087, 1939, 1299, 2775, 1862, 2615, 3050, 5107, 2988, 5681, 5242, 6439, 5656, 10615, 5562, 13083, 9631, 11367, 12362, 14153, 10531, 22719, 17578, 19361, 16050, 31243, 16728, 36207, 24284, 26133]