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.

A127181 a(1)=a(2)=1. a(n) = smallest possible (product of b(k)'s + product of c(k)'s), where the sequence's terms a(1) through a(n-1) are partitioned somehow into {b(k)} and {c(k)}.

Table of values

n a(n)
1 1
2 1
3 2
4 3
5 5
6 11
7 37
8 221
9 3361
10 190777
11 83199527
12 760382931109
13 662056785094857629
14 538451433632092674800570837
15 12495147956629620251492228703104952798089
16 1397663545252630798358314360015943050984074671707253231083973

List of values

[1, 1, 2, 3, 5, 11, 37, 221, 3361, 190777, 83199527, 760382931109, 662056785094857629, 538451433632092674800570837, 12495147956629620251492228703104952798089, 1397663545252630798358314360015943050984074671707253231083973]