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.

A187161 Number of 8-step one space at a time bishop's tours on an n X n board summed over all starting positions.

This page as a plain text file.
%I A187161 #13 Apr 23 2018 12:36:02
%S A187161 0,0,0,0,472,3504,10576,23340,40448,61900,87696,117836,152320,191148,
%T A187161 234320,281836,333696,389900,450448,515340,584576,658156,736080,
%U A187161 818348,904960,995916,1091216,1190860,1294848,1403180,1515856,1632876,1754240
%N A187161 Number of 8-step one space at a time bishop's tours on an n X n board summed over all starting positions.
%C A187161 Row 8 of A187155.
%H A187161 R. H. Hardin, <a href="/A187161/b187161.txt">Table of n, a(n) for n = 1..50</a>
%F A187161 Empirical: a(n) = 2172*n^2 - 19816*n + 42860 for n>6.
%F A187161 Conjectures from _Colin Barker_, Apr 20 2018: (Start)
%F A187161 G.f.: 4*x^5*(118 + 522*x + 370*x^2 + 413*x^3 - 337*x^4) / (1 - x)^3.
%F A187161 a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3) for n>9.
%F A187161 (End)
%e A187161 Some solutions for 5 X 5:
%e A187161 ..0..0..3..0..0....0..0..7..0..0....0..0..0..0..0....0..2..0..0..0
%e A187161 ..0..2..0..4..0....0..6..0..8..0....0..0..7..0..0....3..0..1..0..0
%e A187161 ..1..0..7..0..5....0..0..5..0..0....0..8..0..6..0....0..4..0..0..0
%e A187161 ..0..8..0..6..0....0..4..0..2..0....1..0..3..0..5....5..0..7..0..0
%e A187161 ..0..0..0..0..0....0..0..3..0..1....0..2..0..4..0....0..6..0..8..0
%Y A187161 Cf. A187155.
%K A187161 nonn
%O A187161 1,5
%A A187161 _R. H. Hardin_, Mar 06 2011