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.

A025127 a(n) = s(1)*t(n) + s(2)*t(n-1) + ... + s(k)*t(n-k+1), where k = floor(n/2), s = A023533, t = A000040 (primes).

Table of values

n a(n)
1 3
2 5
3 7
4 11
5 13
6 17
7 30
8 36
9 46
10 50
11 60
12 70
13 74
14 84
15 94
16 102
17 108
18 120
19 161
20 171
21 187
22 197
23 209
24 229
25 243
26 253
27 271
28 281
29 289
30 313
31 323
32 339
33 363
34 381
35 391
36 403
37 421
38 431
39 530
40 552
41 568
42 592
43 618
44 630
45 650
46 674
47 696
48 712
49 746
50 768
51 794
52 802
53 830
54 846
55 872
56 906
57 922
58 942
59 962

List of values

[3, 5, 7, 11, 13, 17, 30, 36, 46, 50, 60, 70, 74, 84, 94, 102, 108, 120, 161, 171, 187, 197, 209, 229, 243, 253, 271, 281, 289, 313, 323, 339, 363, 381, 391, 403, 421, 431, 530, 552, 568, 592, 618, 630, 650, 674, 696, 712, 746, 768, 794, 802, 830, 846, 872, 906, 922, 942, 962]