This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A257061 #8 Dec 20 2018 16:09:55 %S A257061 5,27,141,738,3866,20249,106056,555483,2909419,15238479,79813616, %T A257061 418034724,2189514005,11467878868,60064583029,314596463387, %U A257061 1647741976789,8630273820766,45202238742834,236752903766237,1240025693431636 %N A257061 Number of length n 1..(7+1) arrays with every leading partial sum divisible by 2 or 3. %H A257061 R. H. Hardin, <a href="/A257061/b257061.txt">Table of n, a(n) for n = 1..210</a> %F A257061 Empirical: a(n) = 4*a(n-1) + 5*a(n-2) + 7*a(n-3) + 4*a(n-4). %F A257061 Empirical g.f.: x*(5 + 7*x + 8*x^2 + 4*x^3) / (1 - 4*x - 5*x^2 - 7*x^3 - 4*x^4). - _Colin Barker_, Dec 20 2018 %e A257061 Some solutions for n=4: %e A257061 ..4....6....4....8....3....6....6....6....2....2....2....3....4....4....3....3 %e A257061 ..8....8....6....8....5....2....8....3....2....1....7....3....8....2....7....5 %e A257061 ..4....1....5....6....8....4....2....1....4....7....6....8....6....6....5....8 %e A257061 ..6....1....7....5....2....3....4....4....6....4....1....1....3....3....1....4 %Y A257061 Column 7 of A257062. %K A257061 nonn %O A257061 1,1 %A A257061 _R. H. Hardin_, Apr 15 2015