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.

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

Table of values

n a(n)
1 2
2 3
3 5
4 7
5 16
6 20
7 35
8 43
9 53
10 65
11 86
12 106
13 137
14 153
15 196
16 220
17 246
18 270
19 329
20 353
21 412
22 454
23 521
24 559
25 642
26 686
27 732
28 780
29 869
30 917
31 1032
32 1080
33 1199
34 1263
35 1388
36 1456
37 1597
38 1673
39 1735
40 1823
41 1974
42 2062
43 2227
44 2301
45 2476
46 2572
47 2761
48 2863
49 3062
50 3166
51 3365
52 3475
53 3591

List of values

[2, 3, 5, 7, 16, 20, 35, 43, 53, 65, 86, 106, 137, 153, 196, 220, 246, 270, 329, 353, 412, 454, 521, 559, 642, 686, 732, 780, 869, 917, 1032, 1080, 1199, 1263, 1388, 1456, 1597, 1673, 1735, 1823, 1974, 2062, 2227, 2301, 2476, 2572, 2761, 2863, 3062, 3166, 3365, 3475, 3591]