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.

A283557 The number of positive integer sequences of length n with no duplicate substrings of length greater than 1 and a minimal product (= A282164(n)).

Table of values

n a(n)
1 1
2 1
3 3
4 2
5 2
6 6
7 6
8 24
9 24
10 120
11 120
12 1200
13 1440
14 4320
15 4320
16 8640
17 30240
18 60480
19 483840
20 967680
21 1935360
22 3870720
23 17418240
24 34836480
25 348364800
26 696729600
27 1741824000
28 3483648000
29 19160064000
30 38320128000
31 689762304000
32 1379524608000
33 9656672256000
34 16554295296000
35 66217181184000

List of values

[1, 1, 3, 2, 2, 6, 6, 24, 24, 120, 120, 1200, 1440, 4320, 4320, 8640, 30240, 60480, 483840, 967680, 1935360, 3870720, 17418240, 34836480, 348364800, 696729600, 1741824000, 3483648000, 19160064000, 38320128000, 689762304000, 1379524608000, 9656672256000, 16554295296000, 66217181184000]