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 0..n arrays with no repeated value differing from the previous repeated value by plus or minus one modulo n+1.
1

%I #5 Mar 03 2016 13:31:13

%S 2,9,64,615,7584,114205,2031072,41651631,967466240,25102071621,

%T 719516990160,22578674361815,769853562649248,28340118309069645,

%U 1120229004620264896,47322526714956795615,2127582051231624604416

%N Number of length-n 0..n arrays with no repeated value differing from the previous repeated value by plus or minus one modulo n+1.

%C Diagonal of A269690.

%H R. H. Hardin, <a href="/A269683/b269683.txt">Table of n, a(n) for n = 1..193</a>

%e Some solutions for n=6

%e ..1. .1. .6. .1. .5. .0. .0. .5. .4. .2. .2. .4. .2. .0. .6. .4

%e ..5. .5. .3. .0. .1. .2. .2. .2. .5. .2. .3. .3. .0. .2. .1. .6

%e ..3. .3. .4. .4. .0. .3. .0. .2. .5. .5. .5. .4. .6. .4. .6. .4

%e ..6. .4. .4. .3. .5. .4. .6. .2. .0. .6. .3. .3. .3. .4. .3. .0

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

%e ..2. .3. .0. .3. .5. .5. .6. .2. .5. .6. .0. .4. .4. .5. .5. .0

%Y Cf. A269690.

%K nonn

%O 1,1

%A _R. H. Hardin_, Mar 03 2016