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.

A115355 a(n) is the smallest number representable in exactly n ways as a sum of 3 powerful(1) numbers.

Table of values

n a(n)
1 3
2 17
3 33
4 41
5 66
6 77
7 89
8 117
9 133
10 145
11 153
12 189
13 161
14 225
15 301
16 257
17 324
18 333
19 341
20 297
21 432
22 425
23 369
24 517
25 613
26 441
27 521
28 585
29 513
30 809
31 689
32 792
33 657
34 1001
35 801
36 881
37 1000
38 1017
39 873
40 945
41 900
42 1265
43 1169
44 1425
45 1089
46 1125
47 1197
48 1481
49 1161
50 1584

List of values

[3, 17, 33, 41, 66, 77, 89, 117, 133, 145, 153, 189, 161, 225, 301, 257, 324, 333, 341, 297, 432, 425, 369, 517, 613, 441, 521, 585, 513, 809, 689, 792, 657, 1001, 801, 881, 1000, 1017, 873, 945, 900, 1265, 1169, 1425, 1089, 1125, 1197, 1481, 1161, 1584]