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.

A024369 s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = A023532, t = (1, p(1), p(2), ...).

Table of values

n a(n)
1 1
2 2
3 3
4 5
5 10
6 16
7 25
8 35
9 43
10 53
11 76
12 86
13 119
14 137
15 170
16 196
17 220
18 246
19 293
20 329
21 382
22 412
23 485
24 521
25 596
26 642
27 686
28 732
29 823
30 869
31 964
32 1032
33 1133
34 1199
35 1322
36 1388
37 1517
38 1597
39 1673
40 1735
41 1894
42 1974
43 2135
44 2227
45 2380
46 2476
47 2655
48 2761
49 2952
50 3062
51 3263
52 3365

List of values

[1, 2, 3, 5, 10, 16, 25, 35, 43, 53, 76, 86, 119, 137, 170, 196, 220, 246, 293, 329, 382, 412, 485, 521, 596, 642, 686, 732, 823, 869, 964, 1032, 1133, 1199, 1322, 1388, 1517, 1597, 1673, 1735, 1894, 1974, 2135, 2227, 2380, 2476, 2655, 2761, 2952, 3062, 3263, 3365]