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.

A265375 Number of 5Xn arrays containing n copies of 0..5-1 with no equal horizontal, vertical or antidiagonal neighbors and new values introduced sequentially from 0.

This page as a plain text file.
%I A265375 #5 Aug 12 2016 06:53:58
%S A265375 1,99,4954,363850,25964546,2006263350,159927435847,13175135914848,
%T A265375 1111064939631727,95607791613443343,8362857163936394397
%N A265375 Number of 5Xn arrays containing n copies of 0..5-1 with no equal horizontal, vertical or antidiagonal neighbors and new values introduced sequentially from 0.
%C A265375 Row 5 of A265373.
%e A265375 Some solutions for n=3
%e A265375 ..0..1..2....0..1..0....0..1..2....0..1..2....0..1..0....0..1..2....0..1..2
%e A265375 ..3..0..3....2..3..4....3..4..3....3..4..3....2..3..4....3..0..4....2..3..4
%e A265375 ..2..4..1....1..2..3....1..0..4....1..2..4....4..2..3....1..2..1....1..2..0
%e A265375 ..0..3..4....4..0..2....2..3..2....0..1..0....1..0..2....3..4..0....3..1..4
%e A265375 ..4..2..1....1..3..4....1..0..4....2..4..3....3..1..4....2..3..4....4..0..3
%Y A265375 Cf. A265373.
%K A265375 nonn
%O A265375 1,2
%A A265375 _R. H. Hardin_, Dec 07 2015

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.