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.

A338474 a(n) is the smallest number that can be partitioned into n ways as the sum of two brilliant numbers (A078972).

Table of values

n a(n)
0 1
1 8
2 18
3 338
4 462
5 542
6 638
7 660
8 918
9 858
10 924
11 1260
12 1140
13 1122
14 1428
15 1326
16 1740
17 1710
18 2520
19 2070
20 1938
21 3150
22 3330
23 27342
24 27810
25 29190
26 30600
27 35754
28 32700
29 31710
30 35310
31 32760
32 35952
33 35790
34 35910
35 39450
36 40950
37 41160
38 39060
39 45990
40 40680
41 42510
42 44520

List of values

[1, 8, 18, 338, 462, 542, 638, 660, 918, 858, 924, 1260, 1140, 1122, 1428, 1326, 1740, 1710, 2520, 2070, 1938, 3150, 3330, 27342, 27810, 29190, 30600, 35754, 32700, 31710, 35310, 32760, 35952, 35790, 35910, 39450, 40950, 41160, 39060, 45990, 40680, 42510, 44520]