login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Number of length-(n+6) 0..n arrays with no repeated value equal to the previous repeated value, with new values introduced in sequential order.
1

%I #4 Feb 16 2016 11:54:53

%S 15,525,6723,58409,426289,2918103,19899645,139354433,1014707218,

%T 7708112426,61057289906,503473697674,4313566395798,38328567460364,

%U 352618771825166,3353663922642364,32927374508631249,333319732229912935

%N Number of length-(n+6) 0..n arrays with no repeated value equal to the previous repeated value, with new values introduced in sequential order.

%C Subdiagonal 6 of A268956.

%H R. H. Hardin, <a href="/A268960/b268960.txt">Table of n, a(n) for n = 1..116</a>

%e Some solutions for n=4

%e ..0. .0. .0. .0. .0. .0. .0. .0. .0. .0. .0. .0. .0. .0. .0. .0

%e ..1. .1. .1. .1. .1. .1. .1. .1. .1. .1. .1. .1. .1. .1. .1. .1

%e ..0. .2. .0. .2. .1. .2. .2. .2. .2. .2. .2. .1. .0. .0. .2. .1

%e ..2. .3. .1. .2. .2. .1. .1. .2. .0. .0. .3. .2. .2. .2. .1. .0

%e ..2. .2. .2. .3. .2. .0. .2. .3. .1. .1. .1. .0. .0. .3. .0. .2

%e ..3. .3. .1. .3. .3. .3. .0. .0. .3. .2. .1. .1. .2. .1. .2. .0

%e ..0. .1. .3. .0. .4. .2. .3. .2. .3. .3. .4. .2. .3. .0. .2. .2

%e ..2. .3. .0. .3. .2. .2. .0. .0. .1. .4. .3. .1. .1. .1. .3. .2

%e ..1. .3. .4. .4. .3. .0. .2. .2. .4. .4. .3. .2. .4. .1. .4. .3

%e ..2. .0. .2. .3. .4. .2. .3. .4. .1. .1. .1. .2. .3. .0. .1. .1

%Y Cf. A268956.

%K nonn

%O 1,1

%A _R. H. Hardin_, Feb 16 2016