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.

A264948 Number of 5Xn arrays containing n copies of 0..5-1 with no equal horizontal neighbors and new values introduced sequentially from 0.

This page as a plain text file.
%I A264948 #5 Aug 12 2016 06:53:58
%S A264948 1,544,307016,196389904,137409486772,102117302729744,
%T A264948 79300380540248536,63677294433618454384
%N A264948 Number of 5Xn arrays containing n copies of 0..5-1 with no equal horizontal neighbors and new values introduced sequentially from 0.
%C A264948 Row 5 of A264945.
%e A264948 Some solutions for n=2
%e A264948 ..0..1....0..1....0..1....0..1....0..1....0..1....0..1....0..1....0..1....0..1
%e A264948 ..2..3....2..3....2..3....2..3....2..3....0..2....2..3....2..3....2..3....2..3
%e A264948 ..4..2....4..0....0..4....0..4....2..0....1..3....0..4....0..1....1..0....4..3
%e A264948 ..1..3....1..2....2..3....2..1....4..3....2..4....1..4....2..4....3..4....0..4
%e A264948 ..0..4....4..3....4..1....3..4....1..4....4..3....3..2....3..4....4..2....2..1
%Y A264948 Cf. A264945.
%K A264948 nonn
%O A264948 1,2
%A A264948 _R. H. Hardin_, Nov 29 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.