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 #5 May 28 2021 15:04:51
%S 36,876,9289,67453,377824,1765350
%N Number of n X 5 1..3 arrays containing at least one of each value, all equal values connected, and rows considered as a single number in nondecreasing order.
%e Some solutions for n=3
%e ...1.1.2.2.2...2.2.2.2.2...1.1.1.2.2...1.1.1.1.1...2.2.2.2.2...2.1.3.3.3
%e ...3.1.1.1.2...2.2.3.2.1...2.2.1.2.3...1.1.1.2.1...3.2.3.1.1...2.2.3.3.3
%e ...3.2.2.2.2...3.3.3.3.1...2.2.2.2.2...3.3.2.2.1...3.3.3.3.1...3.3.3.3.3
%e ------
%e ...2.2.2.1.1...1.1.1.1.1...2.2.2.2.2...1.1.3.3.2...3.1.1.1.1...1.1.1.1.1
%e ...2.2.2.2.2...1.1.3.3.1...2.3.2.2.1...1.3.3.2.2...3.2.2.2.2...1.1.1.1.1
%e ...3.3.3.3.2...1.2.3.3.3...3.3.3.2.2...2.2.2.2.2...3.3.2.2.2...1.1.2.1.3
%K nonn
%O 1,1
%A _R. H. Hardin_ Oct 21 2009