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 A269608 #8 Jan 25 2019 08:29:09 %S A269608 10,154,804,2692,7030,15630,31024,56584,96642,156610,243100,364044, %T A269608 528814,748342,1035240,1403920,1870714,2453994,3174292,4054420, %U A269608 5119590,6397534,7918624,9715992,11825650,14286610,17141004,20434204,24214942 %N A269608 Number of length-5 0..n arrays with no repeated value differing from the previous repeated value by one or less. %H A269608 R. H. Hardin, <a href="/A269608/b269608.txt">Table of n, a(n) for n = 1..210</a> %F A269608 Empirical: a(n) = n^5 + 5*n^4 + 7*n^3 - 4*n^2 + n. %F A269608 Conjectures from _Colin Barker_, Jan 25 2019: (Start) %F A269608 G.f.: 2*x*(5 + 47*x + 15*x^2 - 11*x^3 + 4*x^4) / (1 - x)^6. %F A269608 a(n) = 6*a(n-1) - 15*a(n-2) + 20*a(n-3) - 15*a(n-4) + 6*a(n-5) - a(n-6) for n>6. %F A269608 (End) %e A269608 Some solutions for n=7: %e A269608 ..2. .3. .4. .7. .7. .4. .6. .7. .1. .2. .6. .4. .1. .2. .4. .5 %e A269608 ..6. .2. .7. .5. .3. .3. .4. .7. .4. .1. .0. .6. .5. .4. .2. .6 %e A269608 ..1. .5. .1. .4. .6. .1. .5. .5. .2. .0. .7. .4. .3. .0. .0. .1 %e A269608 ..4. .0. .7. .2. .4. .4. .4. .1. .7. .6. .1. .4. .6. .4. .4. .7 %e A269608 ..7. .3. .5. .5. .4. .7. .3. .3. .2. .2. .1. .2. .6. .1. .2. .0 %Y A269608 Row 5 of A269606. %K A269608 nonn %O A269608 1,1 %A A269608 _R. H. Hardin_, Mar 01 2016