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)).
Original entry on oeis.org
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
Offset: 1
For n = 7, the a(7) = 6 sequences are
1,3,1,2,2,1,1;
1,2,2,1,3,1,1;
1,3,1,1,2,2,1;
1,1,3,1,2,2,1;
1,2,2,1,1,3,1; and
1,1,2,2,1,3,1.
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)).
Original entry on oeis.org
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
Offset: 1
For n = 7 the a(7) = 6 solutions are:
[1,4,1,3,1,2,1],
[1,3,1,4,1,2,1],
[1,4,1,2,1,3,1],
[1,2,1,4,1,3,1],
[1,3,1,2,1,4,1], and
[1,2,1,3,1,4,1].
A284433
The number of positive integer sequences of length n with no duplicate substrings (forward or backward) of length greater than 1, every number different from its neighbors, and a minimal sum (= A282167(n)).
Original entry on oeis.org
1, 2, 6, 2, 18, 12, 24, 24, 1320, 240, 528, 720, 5664, 105888, 16992, 150048, 244800, 4266432, 4375296, 39598848, 50637312, 123310080, 202549248, 15925690368, 3765657600, 23454351360, 101739110400, 437749678080, 1572538613760, 11891771080704, 7862693068800, 185042766200832
Offset: 1
For n = 4 the a(4) = 2 solutions are [1,3,2,1] and [1,2,3,1].
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)).
Original entry on oeis.org
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
Offset: 1
For n = 7 the a(7) = 4 solutions are:
[1,3,3,2,2,1,1],
[1,2,2,3,3,1,1],
[1,1,3,3,2,2,1], and
[1,1,2,2,3,3,1].
Showing 1-4 of 4 results.
Comments