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.

A221462 Number of 0..7 arrays of length n with each element unequal to at least one neighbor, starting with 0.

This page as a plain text file.
%I A221462 #6 Jun 02 2025 08:21:08
%S A221462 0,7,49,392,3087,24353,192080,1515031,11949777,94253656,743424031,
%T A221462 5863743809,46250174880,364797430823,2877333239921,22694914695208,
%U A221462 179005735545903,1411904551687777,11136372010635760,87837935936264759
%N A221462 Number of 0..7 arrays of length n with each element unequal to at least one neighbor, starting with 0.
%C A221462 Column 7 of A221463
%H A221462 R. H. Hardin, <a href="/A221462/b221462.txt">Table of n, a(n) for n = 1..134</a>
%F A221462 Empirical: a(n) = 7*a(n-1) +7*a(n-2)
%e A221462 Some solutions for n=6
%e A221462 ..0....0....0....0....0....0....0....0....0....0....0....0....0....0....0....0
%e A221462 ..6....5....5....7....7....1....7....4....1....3....1....4....2....5....6....1
%e A221462 ..1....4....5....3....2....2....4....7....1....5....2....3....5....2....7....2
%e A221462 ..1....1....0....4....0....3....6....5....2....1....4....3....1....7....3....5
%e A221462 ..4....6....4....4....3....7....1....2....1....1....2....0....0....4....5....1
%e A221462 ..2....2....6....7....0....1....2....0....5....2....1....4....6....0....0....0
%K A221462 nonn
%O A221462 1,2
%A A221462 _R. H. Hardin_ Jan 17 2013