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.

A268455 Number of length-n 0..6 arrays with no adjacent pair x,x+1 followed at any distance by x+1,x.

This page as a plain text file.
%I A268455 #4 Feb 04 2016 22:03:37
%S A268455 7,49,337,2311,15816,108032,736525,5012171,34047931,230889543,
%T A268455 1563104184,10564826628,71293105297,480355314513,3231663192859,
%U A268455 21709801573961,145636117720769,975623832619371,6526972402359763,43608650962250889
%N A268455 Number of length-n 0..6 arrays with no adjacent pair x,x+1 followed at any distance by x+1,x.
%C A268455 Column 6 of A268457.
%H A268455 R. H. Hardin, <a href="/A268455/b268455.txt">Table of n, a(n) for n = 1..210</a>
%H A268455 R. H. Hardin, <a href="/A268455/a268455.txt">Empirical recurrence of order 89</a>
%F A268455 Empirical recurrence of order 89 (see link above)
%e A268455 Some solutions for n=6
%e A268455 ..4....4....2....2....4....1....0....4....5....1....2....4....2....0....3....1
%e A268455 ..4....3....6....4....1....0....0....2....4....0....4....3....3....4....6....1
%e A268455 ..4....0....6....5....3....6....3....1....0....6....2....1....3....3....2....2
%e A268455 ..0....4....4....6....0....5....5....0....4....6....3....3....4....2....4....0
%e A268455 ..6....4....4....4....2....2....3....4....1....6....0....5....5....1....3....5
%e A268455 ..3....5....1....4....2....0....5....3....0....5....6....1....1....2....1....2
%Y A268455 Cf. A268457.
%K A268455 nonn
%O A268455 1,1
%A A268455 _R. H. Hardin_, Feb 04 2016