The number of positive integer sequences of length n with no duplicate substrings (forward or backward) of length greater than 1 and a minimal sum (= A282168(n)).
A284432
The number of positive integer sequences of length n with no duplicate substrings (forward or backward) of length greater than 1 and a minimal sum (= A282168(n)).
Terms
- a(0) =1a(1) =1a(2) =2a(3) =2a(4) =4a(5) =4a(6) =4a(7) =48a(8) =48a(9) =144a(10) =144a(11) =144a(12) =2160a(13) =8496a(14) =21312a(15) =110592a(16) =203904a(17) =407808a(18) =815616a(19) =1631232a(20) =15667200a(21) =31334400a(22) =445114368a(23) =890228736a(24) =7291772928a(25) =14583545856a(26) =36458864640a(27) =72917729280a(28) =145835458560
External references
- oeis: A284432