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.

A284436 The number of positive integer sequences of length n with no duplicate substrings (forward or backward) of length greater than 1, no self-adjacent terms, and a minimal product (= A282170(n)).

Original entry on oeis.org

1, 2, 6, 2, 18, 12, 24, 24, 792, 240, 1440, 720, 7488, 10080, 16992, 40320, 1013760, 725760, 979200, 3628800, 17902080, 79833600, 89510400, 479001600, 1988582400, 11446272000, 11931494400, 108138240000, 312309043200, 1539772416000, 2186163302400, 19872992563200
Offset: 1

Views

Author

Peter Kagey, Mar 27 2017

Keywords

Examples

			For n = 4 the a(4) = 2 solutions are [1,3,2,1] and [1,2,3,1].
		

Crossrefs

Extensions

Name edited and terms a(9) onward added by Max Alekseyev, Feb 06 2025