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.

A223355 Rolling cube footprints: number of n X 6 0..5 arrays starting with 0 where 0..5 label faces of a cube and every array movement to a horizontal or antidiagonal neighbor moves across a corresponding cube edge.

This page as a plain text file.
%I A223355 #9 Aug 19 2018 18:12:59
%S A223355 1024,1327104,1764753408,2356125106176,3147420753985536,
%T A223355 4204783428144463872,5617417467128419713024,7504647859211051911348224,
%U A223355 10025914758161450104466178048,13394228581283493899583803621376
%N A223355 Rolling cube footprints: number of n X 6 0..5 arrays starting with 0 where 0..5 label faces of a cube and every array movement to a horizontal or antidiagonal neighbor moves across a corresponding cube edge.
%C A223355 Column 6 of A223357.
%H A223355 R. H. Hardin, <a href="/A223355/b223355.txt">Table of n, a(n) for n = 1..210</a>
%F A223355 Empirical: a(n) = 1600*a(n-1) - 368640*a(n-2) + 21233664*a(n-3).
%F A223355 Empirical g.f.: 1024*x*(1 - 304*x + 18432*x^2) / (1 - 1600*x + 368640*x^2 - 21233664*x^3). - _Colin Barker_, Aug 19 2018
%e A223355 Some solutions for n=3:
%e A223355   0 3 0 3 4 2    0 3 0 2 0 3    0 3 0 2 5 1    0 3 0 1 0 1
%e A223355   0 3 0 3 0 4    0 3 0 3 0 3    0 3 0 4 2 1    0 3 0 2 5 4
%e A223355   0 3 0 1 2 4    0 3 0 3 5 3    0 3 0 1 3 4    0 3 0 4 5 3
%Y A223355 Cf. A223357.
%K A223355 nonn
%O A223355 1,1
%A A223355 _R. H. Hardin_, Mar 19 2013