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.

A269772 Number of length-n 0..4 arrays with every repeated value unequal to the previous repeated value plus one mod 4+1.

This page as a plain text file.
%I A269772 #8 Jan 29 2019 05:32:33
%S A269772 5,25,125,620,3060,15040,73680,360000,1755200,8542720,41519360,
%T A269772 201559040,977556480,4737433600,22943846400,111060664320,537360220160,
%U A269772 2599052247040,12567124705280,60750607155200,293614524825600
%N A269772 Number of length-n 0..4 arrays with every repeated value unequal to the previous repeated value plus one mod 4+1.
%H A269772 R. H. Hardin, <a href="/A269772/b269772.txt">Table of n, a(n) for n = 1..210</a>
%F A269772 Empirical: a(n) = 8*a(n-1) - 12*a(n-2) - 16*a(n-3).
%F A269772 Empirical g.f.: 5*x*(1 - 3*x - 3*x^2) / ((1 - 4*x)*(1 - 4*x - 4*x^2)). - _Colin Barker_, Jan 29 2019
%e A269772 Some solutions for n=7:
%e A269772 ..2. .2. .4. .4. .3. .2. .1. .4. .4. .1. .0. .3. .4. .4. .0. .3
%e A269772 ..4. .0. .2. .1. .1. .2. .2. .0. .1. .2. .4. .1. .4. .2. .3. .3
%e A269772 ..1. .1. .2. .3. .0. .0. .1. .2. .2. .0. .3. .0. .4. .4. .1. .1
%e A269772 ..3. .0. .2. .3. .3. .2. .3. .1. .1. .4. .4. .3. .4. .3. .1. .2
%e A269772 ..2. .1. .1. .3. .0. .2. .2. .4. .3. .3. .1. .4. .2. .2. .0. .4
%e A269772 ..3. .4. .4. .2. .2. .4. .0. .0. .2. .1. .0. .4. .4. .1. .4. .0
%e A269772 ..0. .1. .1. .2. .2. .0. .3. .3. .2. .0. .2. .1. .4. .3. .0. .4
%Y A269772 Column 4 of A269776.
%K A269772 nonn
%O A269772 1,1
%A A269772 _R. H. Hardin_, Mar 04 2016