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 A228213 #9 Sep 29 2023 07:58:13 %S A228213 13,103,625,3151,14053,58975,242461,989527,4017157,16245775,65514541, %T A228213 263652487,1059392917,4251920575,17050729021,68332056247,273715645477, %U A228213 1096024843375,4387586157901,17560804984807,70274600998837 %N A228213 Number of second differences of arrays of length n + 2 of numbers in 0..3. %H A228213 R. H. Hardin, <a href="/A228213/b228213.txt">Table of n, a(n) for n = 1..210</a> %F A228213 Empirical: a(n) = 7*a(n-1) - 12*a(n-2) = A005061(n+2) for n>7. %F A228213 Conjectures from _Colin Barker_, Sep 09 2018: (Start) %F A228213 G.f.: x*(13 + 12*x + 60*x^2 + 12*x^3 - 504*x^4 - 1584*x^5 - 1728*x^6) / ((1 - 3*x)*(1 - 4*x)). %F A228213 a(n) = 4^(2+n) - 3^(2+n) for n>5. %F A228213 (End) %e A228213 Some solutions for n=4: %e A228213 ..5....0...-5....3....4....1....3...-3...-6....2....2....1...-5....1....0....2 %e A228213 .-4....2....2...-3...-5....1....1....3....3...-1....3....1....3....4....3....1 %e A228213 ..2....0...-1....5....5...-3...-5....1....1....4...-5....1....0...-6...-3...-1 %e A228213 ..3...-2....2...-6...-2....0....3...-5....1...-5....4...-1...-3....6....3....0 %Y A228213 Column 3 of A228218. %K A228213 nonn %O A228213 1,1 %A A228213 _R. H. Hardin_, Aug 16 2013