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 A189322 #8 May 02 2018 09:22:33 %S A189322 8,12,21,33,54,84,119,157,195,233,271,309,347,385,423,461,499,537,575, %T A189322 613,651,689,727,765,803,841,879,917,955,993,1031,1069,1107,1145,1183, %U A189322 1221,1259,1297,1335,1373,1411,1449,1487,1525,1563,1601,1639,1677,1715 %N A189322 Number of nondecreasing arrangements of n+2 numbers in 0..5 with the last equal to 5 and each after the second equal to the sum of one or two of the preceding four. %C A189322 Column 5 of A189326. %H A189322 R. H. Hardin, <a href="/A189322/b189322.txt">Table of n, a(n) for n = 1..200</a> %F A189322 Empirical: a(n) = 38*n - 147 for n>6. %F A189322 Empirical g.f.: x*(8 - 4*x + 5*x^2 + 3*x^3 + 9*x^4 + 9*x^5 + 5*x^6 + 3*x^7) / (1 - x)^2. - _Colin Barker_, May 02 2018 %e A189322 Some solutions for n=3: %e A189322 ..1....1....2....5....1....1....1....1....1....4....1....2....3....2....1....0 %e A189322 ..2....2....3....5....3....2....2....1....3....5....3....5....5....3....4....5 %e A189322 ..2....3....3....5....3....2....3....2....4....5....4....5....5....3....4....5 %e A189322 ..4....3....5....5....4....3....4....3....5....5....4....5....5....3....4....5 %e A189322 ..5....5....5....5....5....5....5....5....5....5....5....5....5....5....5....5 %Y A189322 Cf. A189326. %K A189322 nonn %O A189322 1,1 %A A189322 _R. H. Hardin_, Apr 20 2011