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.

A206472 T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with every 2X2 subblock having zero permanent.

This page as a plain text file.
%I A206472 #9 Jul 22 2025 19:28:40
%S A206472 25,121,121,441,1411,441,1849,11025,11025,1849,7225,106891,110889,
%T A206472 106891,7225,29241,958441,1896129,1896129,958441,29241,116281,8963667,
%U A206472 23707161,68352739,23707161,8963667,116281,466489,82609921,356190129,1693734025
%N A206472 T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with every 2X2 subblock having zero permanent.
%C A206472 Table starts
%C A206472 .....25.......121.........441...........1849.............7225
%C A206472 ....121......1411.......11025.........106891...........958441
%C A206472 ....441.....11025......110889........1896129.........23707161
%C A206472 ...1849....106891.....1896129.......68352739.......1693734025
%C A206472 ...7225....958441....23707161.....1693734025......61244865529
%C A206472 ..29241...8963667...356190129....52552339515....3420616959081
%C A206472 .116281..82609921..4803737481..1457044540561..144660587865049
%C A206472 .466489.767387611.69030731169.43214597865811.7310031634630729
%H A206472 R. H. Hardin, <a href="/A206472/b206472.txt">Table of n, a(n) for n = 1..684</a>
%e A206472 Some solutions for n=4 k=3
%e A206472 ..0..2..0..2....0..0..0..1....2..0..1..2....2..2..0..0....1..2..0..0
%e A206472 ..0..1..0..0....1..0..0..1....1..0..0..0....0..0..0..1....0..0..0..2
%e A206472 ..0..2..0..1....0..0..0..0....1..0..2..0....2..0..0..0....1..0..0..0
%e A206472 ..0..0..0..0....1..2..0..1....1..0..0..0....2..0..0..1....0..0..1..0
%e A206472 ..0..2..2..2....0..0..0..1....0..0..2..1....2..0..0..2....1..0..2..0
%Y A206472 Column 1 is A139818(n+3)
%K A206472 nonn,tabl
%O A206472 1,1
%A A206472 _R. H. Hardin_ Feb 08 2012