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 Feb 08 2015 10:31:04
%S 4,13,30,54,95,121,185,259,376,450,643,750,992,1249,1580,1768,2232,
%T 2462,2998,3501,4117,4459,5276,5975,6855,7676,8696,9261,10648,11273,
%U 12617,13921,15437,16899,18790,19699,21588,23355,25521,26644,29216,30450,33004
%N Number of length 3 1..(n+1) arrays with every leading partial sum divisible by 2, 3 or 5
%C Row 3 of A254827
%H R. H. Hardin, <a href="/A254830/b254830.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = a(n-1) +3*a(n-30) -3*a(n-31) -3*a(n-60) +3*a(n-61) +a(n-90) -a(n-91)
%e Some solutions for n=4
%e ..2....4....5....3....4....4....4....2....2....5....3....4....4....5....2....3
%e ..2....1....3....2....4....1....2....1....1....1....5....1....2....1....4....2
%e ..4....5....4....4....1....4....4....1....5....4....1....1....3....3....2....5
%K nonn
%O 1,1
%A _R. H. Hardin_, Feb 08 2015