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.

A268942 Number of length-n 0..6 arrays with no repeated value unequal to the previous repeated value plus one mod 6+1.

This page as a plain text file.
%I A268942 #8 Jan 17 2019 03:59:26
%S A268942 7,49,336,2275,15239,101192,667065,4370261,28480312,184750699,
%T A268942 1193659551,7684815880,49319275649,315627565757,2014797616440,
%U A268942 12831930191171,81554529162967,517343926505224,3276087952780041,20712766946115685
%N A268942 Number of length-n 0..6 arrays with no repeated value unequal to the previous repeated value plus one mod 6+1.
%H A268942 R. H. Hardin, <a href="/A268942/b268942.txt">Table of n, a(n) for n = 1..210</a>
%F A268942 Empirical: a(n) = 11*a(n-1) - 23*a(n-2) - 42*a(n-3).
%F A268942 Empirical g.f.: 7*x*(1 - 4*x - 6*x^2) / ((1 - 6*x)*(1 - 5*x - 7*x^2)). - _Colin Barker_, Jan 17 2019
%e A268942 Some solutions for n=6:
%e A268942 ..5. .0. .4. .6. .1. .1. .3. .2. .5. .0. .6. .4. .6. .5. .3. .1
%e A268942 ..4. .4. .1. .5. .5. .0. .3. .0. .1. .3. .4. .4. .1. .3. .1. .6
%e A268942 ..3. .6. .2. .6. .0. .2. .2. .5. .5. .1. .2. .0. .3. .1. .1. .6
%e A268942 ..6. .3. .0. .4. .4. .3. .5. .2. .5. .0. .4. .3. .1. .4. .0. .5
%e A268942 ..0. .5. .0. .1. .5. .6. .6. .3. .1. .6. .0. .5. .2. .6. .2. .0
%e A268942 ..1. .1. .3. .4. .4. .3. .5. .4. .4. .2. .1. .4. .6. .2. .2. .3
%Y A268942 Column 6 of A268944.
%K A268942 nonn
%O A268942 1,1
%A A268942 _R. H. Hardin_, Feb 16 2016