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.

A284435 The number of positive integer sequences of length n with no duplicate substrings (forward or backward) of length greater than 1 and a minimal product (= A282193(n)).

Table of values

n a(n)
1 1
2 1
3 2
4 2
5 4
6 4
7 4
8 48
9 144
10 144
11 144
12 2304
13 2160
14 8640
15 8640
16 8640
17 161280
18 806400
19 806400
20 806400
21 38534400
22 39168000
23 108864000
24 108864000
25 2794176000
26 5370624000
27 10741248000
28 21482496000
29 286355865600
30 1002245529600
31 2004491059200
32 4008982118400
33 61212572467200
34 244850289868800
35 489700579737600

List of values

[1, 1, 2, 2, 4, 4, 4, 48, 144, 144, 144, 2304, 2160, 8640, 8640, 8640, 161280, 806400, 806400, 806400, 38534400, 39168000, 108864000, 108864000, 2794176000, 5370624000, 10741248000, 21482496000, 286355865600, 1002245529600, 2004491059200, 4008982118400, 61212572467200, 244850289868800, 489700579737600]

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

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