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.

A343940 Sum of numbers of ways to choose a k-chain of divisors of n - k, for k = 0..n - 1.

Table of values

n a(n)
1 1
2 2
3 4
4 7
5 12
6 19
7 30
8 45
9 66
10 95
11 135
12 187
13 256
14 346
15 463
16 613
17 803
18 1040
19 1336
20 1703
21 2158
22 2720
23 3409
24 4244
25 5251
26 6461
27 7911
28 9643
29 11707
30 14157
31 17058
32 20480
33 24502
34 29212
35 34707
36 41094
37 48496
38 57053
39 66926
40 78296
41 91369
42 106376
43 123581
44 143276
45 165786

List of values

[1, 2, 4, 7, 12, 19, 30, 45, 66, 95, 135, 187, 256, 346, 463, 613, 803, 1040, 1336, 1703, 2158, 2720, 3409, 4244, 5251, 6461, 7911, 9643, 11707, 14157, 17058, 20480, 24502, 29212, 34707, 41094, 48496, 57053, 66926, 78296, 91369, 106376, 123581, 143276, 165786]