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.

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

Table of values

n a(n)
0 0
1 36
2 63
3 174
4 198
5 306
6 312
7 399
8 1176
9 930
10 1296
11 1989
12 1110
13 888
14 2190
15 1896
16 2688
17 3990
18 3630
19 3090
20 3696
21 3810
22 8316
23 6870
24 4710
25 12420
26 11340
27 9180
28 13350
29 12990
30 14070
31 14364
32 14970
33 9900
34 15444
35 14790
36 15012
37 18570
38 19980
39 25164
40 23610
41 25092
42 23790

List of values

[0, 36, 63, 174, 198, 306, 312, 399, 1176, 930, 1296, 1989, 1110, 888, 2190, 1896, 2688, 3990, 3630, 3090, 3696, 3810, 8316, 6870, 4710, 12420, 11340, 9180, 13350, 12990, 14070, 14364, 14970, 9900, 15444, 14790, 15012, 18570, 19980, 25164, 23610, 25092, 23790]