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.

A283558 The number of positive integer sequences of length n with no duplicate substrings of length greater than 1 and a minimal sum (= A259280(n)).

Table of values

n a(n)
1 1
2 1
3 3
4 2
5 2
6 6
7 6
8 48
9 60
10 168
11 144
12 288
13 1872
14 3744
15 5760
16 11520
17 161280
18 322560
19 1866240
20 2903040
21 10782720
22 8294400
23 24883200
24 282009600
25 846028800
26 3060633600
27 9181900800
28 10450944000
29 31352832000
30 668860416000
31 1881169920000
32 17850212352000
33 41009504256000
34 248816074752000
35 381752082432000

List of values

[1, 1, 3, 2, 2, 6, 6, 48, 60, 168, 144, 288, 1872, 3744, 5760, 11520, 161280, 322560, 1866240, 2903040, 10782720, 8294400, 24883200, 282009600, 846028800, 3060633600, 9181900800, 10450944000, 31352832000, 668860416000, 1881169920000, 17850212352000, 41009504256000, 248816074752000, 381752082432000]