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.

A024696 a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = A014306, t = (primes).

Table of values

n a(n)
1 0
2 0
3 3
4 5
5 12
6 18
7 24
8 30
9 47
10 55
11 82
12 96
13 127
14 149
15 186
16 210
17 261
18 293
19 319
20 349
21 412
22 444
23 517
24 557
25 634
26 680
27 773
28 819
29 918
30 976
31 1079
32 1147
33 1268
34 1324
35 1455
36 1535
37 1680
38 1758
39 1844
40 1918
41 2075
42 2167
43 2334
44 2422
45 2607
46 2703
47 2890
48 3002
49 3213
50 3311
51 3522
52 3634

List of values

[0, 0, 3, 5, 12, 18, 24, 30, 47, 55, 82, 96, 127, 149, 186, 210, 261, 293, 319, 349, 412, 444, 517, 557, 634, 680, 773, 819, 918, 976, 1079, 1147, 1268, 1324, 1455, 1535, 1680, 1758, 1844, 1918, 2075, 2167, 2334, 2422, 2607, 2703, 2890, 3002, 3213, 3311, 3522, 3634]