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.

A212827 Number of 0..6 arrays of length n with no adjacent pair equal to its immediately preceding adjacent pair, and new values introduced in 0..6 order.

This page as a plain text file.
%I A212827 #6 Jul 22 2025 22:58:00
%S A212827 1,2,5,13,44,168,717,3359,17055,92749,534071,3220152,20122695,
%T A212827 129180223,845868450,5618381653,37699577379,254789247816,
%U A212827 1730682217663,11797467544723,80618379435810,551861368167305,3782253874750807
%N A212827 Number of 0..6 arrays of length n with no adjacent pair equal to its immediately preceding adjacent pair, and new values introduced in 0..6 order.
%C A212827 Column 6 of A212829
%H A212827 R. H. Hardin, <a href="/A212827/b212827.txt">Table of n, a(n) for n = 1..210</a>
%F A212827 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) for n>13
%e A212827 Some solutions for n=8
%e A212827 ..0....0....0....0....0....0....0....0....0....0....0....0....0....0....0....0
%e A212827 ..1....1....1....1....1....1....1....0....1....1....1....1....1....1....0....1
%e A212827 ..2....2....0....2....0....2....0....1....2....2....2....1....2....2....1....2
%e A212827 ..3....3....2....0....0....3....2....1....1....3....1....0....2....0....2....2
%e A212827 ..3....3....1....0....1....3....1....2....3....2....0....0....3....3....1....3
%e A212827 ..0....2....2....1....1....3....2....2....3....4....3....2....4....0....3....2
%e A212827 ..4....2....3....1....2....4....2....0....2....1....4....3....3....1....0....1
%e A212827 ..0....4....3....3....2....2....2....0....1....2....5....4....5....3....3....3
%K A212827 nonn
%O A212827 1,2
%A A212827 _R. H. Hardin_ May 28 2012