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”).
%I #4 Oct 06 2014 18:41:37
%S 41670,226410,1233820,6729772,36721992,200399588,1093511486,
%T 5966952566,32560374732,177677103884,969563996216,5290815241868,
%U 28871430622248,157548387750490,859725212966036,4691431970353970,25600663854138064
%N Number of length n+5 0..5 arrays with no three disjoint pairs in any consecutive six terms having the same sum
%C Column 5 of A248448
%H R. H. Hardin, <a href="/A248445/b248445.txt">Table of n, a(n) for n = 1..210</a>
%e Some solutions for n=1
%e ..3....1....0....4....0....0....3....5....4....0....1....5....3....0....1....2
%e ..0....0....5....3....0....1....2....3....0....2....0....4....5....3....5....0
%e ..2....3....2....1....1....1....0....3....2....1....1....0....5....4....4....4
%e ..2....5....1....4....5....1....1....2....4....1....5....3....4....3....5....3
%e ..2....0....2....5....3....0....4....5....4....2....2....4....1....3....5....2
%e ..2....3....0....3....4....3....4....2....0....4....1....2....5....4....4....3
%K nonn
%O 1,1
%A _R. H. Hardin_, Oct 06 2014