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.

A284434 The number of positive integer sequences of length n with no duplicate substrings of length greater than 1, every number different from its neighbors, and a minimal product (= A282169(n)).

Table of values

n a(n)
1 1
2 2
3 1
4 6
5 2
6 24
7 6
8 120
9 24
10 84
11 192
12 336
13 360
14 1680
15 2160
16 10080
17 26640
18 70560
19 80640
20 564480
21 645120
22 13789440
23 10644480
24 78382080
25 43545600
26 783820800
27 435456000
28 2264371200
29 12454041600
30 22643712000
31 117747302400
32 466460467200
33 367873228800
34 2391175987200
35 4414478745600

List of values

[1, 2, 1, 6, 2, 24, 6, 120, 24, 84, 192, 336, 360, 1680, 2160, 10080, 26640, 70560, 80640, 564480, 645120, 13789440, 10644480, 78382080, 43545600, 783820800, 435456000, 2264371200, 12454041600, 22643712000, 117747302400, 466460467200, 367873228800, 2391175987200, 4414478745600]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.