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.

A242469 Number of length n+2 0..6 arrays with no three equal elements in a row and new values 0..6 introduced in 0..6 order.

This page as a plain text file.
%I A242469 #6 Jul 23 2025 11:16:31
%S A242469 4,12,41,159,685,3232,16497,90075,520248,3143900,19678699,126480319,
%T A242469 828889655,5508880129,36980189248,249999755818,1698491520413,
%U A242469 11579658486155,79137696973965,541762392142995,3713215153801152
%N A242469 Number of length n+2 0..6 arrays with no three equal elements in a row and new values 0..6 introduced in 0..6 order.
%C A242469 Column 6 of A242472
%H A242469 R. H. Hardin, <a href="/A242469/b242469.txt">Table of n, a(n) for n = 1..210</a>
%F A242469 Empirical: a(n) = 16*a(n-1) -79*a(n-2) +70*a(n-3) +361*a(n-4) -372*a(n-5) -964*a(n-6) +144*a(n-7) +1116*a(n-8) +720*a(n-9) +144*a(n-10)
%e A242469 Some solutions for n=4
%e A242469 ..0....0....0....0....0....0....0....0....0....0....0....0....0....0....0....0
%e A242469 ..1....1....1....1....0....1....1....1....1....1....1....0....1....1....1....1
%e A242469 ..2....2....2....2....1....2....2....0....2....2....2....1....1....2....2....1
%e A242469 ..3....1....3....3....1....0....3....2....0....3....0....0....2....1....0....2
%e A242469 ..4....3....2....3....2....3....0....3....0....1....2....2....0....3....2....0
%e A242469 ..3....4....4....4....3....0....3....2....1....1....1....1....0....3....3....1
%K A242469 nonn
%O A242469 1,1
%A A242469 _R. H. Hardin_, May 15 2014