cp's OEIS Frontend

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.

A250357 Number of length n arrays x(i), i=1..n with x(i) in i..i+4 and no value appearing more than 3 times.

This page as a plain text file.
%I A250357 #8 Nov 13 2018 08:38:00
%S A250357 5,25,125,623,3094,15365,76300,378880,1881364,9342081,46388915,
%T A250357 230348138,1143813376,5679703079,28203050974,140044659409,
%U A250357 695403722139,3453086599482,17146596550508,85142890221146,422784296221329
%N A250357 Number of length n arrays x(i), i=1..n with x(i) in i..i+4 and no value appearing more than 3 times.
%H A250357 R. H. Hardin, <a href="/A250357/b250357.txt">Table of n, a(n) for n = 1..210</a>
%F A250357 Empirical: a(n) = 5*a(n-1) - 2*a(n-4) - 11*a(n-5) + a(n-8).
%F A250357 Empirical g.f.: x*(5 - 2*x^3 - 11*x^4 + x^7) / (1 - 5*x + 2*x^4 + 11*x^5 - x^8). - _Colin Barker_, Nov 13 2018
%e A250357 Some solutions for n=6:
%e A250357 ..2....4....0....0....2....2....0....2....0....1....3....3....4....1....2....0
%e A250357 ..4....3....4....2....2....3....2....3....4....1....2....1....4....1....5....3
%e A250357 ..2....5....5....5....6....6....4....6....3....2....2....5....5....5....6....6
%e A250357 ..4....6....7....6....3....5....5....4....7....4....4....7....4....4....7....3
%e A250357 ..8....7....4....5....5....8....6....4....7....7....5....6....6....8....6....8
%e A250357 ..7....9....9....6....5....7....7....8....6....5....5....7....6....5....8....9
%Y A250357 Column 4 of A250361.
%K A250357 nonn
%O A250357 1,1
%A A250357 _R. H. Hardin_, Nov 19 2014