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.

A187645 T(n,k)=Number of (n+2)X(k+2) 0..2 arrays with each 3X3 subblock having sum 9.

This page as a plain text file.
%I A187645 #7 Jun 02 2025 03:59:30
%S A187645 3139,17701,17701,101419,79259,101419,596653,363533,363533,596653,
%T A187645 3703651,1747075,1342083,1747075,3703651,23126677,9368309,5273797,
%U A187645 5273797,9368309,23126677,145502251,51019403,24351579,17048731,24351579
%N A187645 T(n,k)=Number of (n+2)X(k+2) 0..2 arrays with each 3X3 subblock having sum 9.
%C A187645 Table starts
%C A187645 .......3139......17701....101419....596653...3703651..23126677..145502251
%C A187645 ......17701......79259....363533...1747075...9368309..51019403..283738813
%C A187645 .....101419.....363533...1342083...5273797..24351579.115259453..564564211
%C A187645 .....596653....1747075...5273797..17048731..67476109.275808307.1180360357
%C A187645 ....3703651....9368309..24351579..67476109.234213387
%C A187645 ...23126677...51019403.115259453.275808307
%C A187645 ..145502251..283738813.564564211
%C A187645 ..935121589.1661843915
%C A187645 .6025592131
%H A187645 R. H. Hardin, <a href="/A187645/b187645.txt">Table of n, a(n) for n = 1..49</a>
%e A187645 Some solutions for 5X4
%e A187645 ..0..1..1..0....0..2..1..0....0..1..2..1....0..2..0..0....0..0..2..2
%e A187645 ..0..2..0..1....0..1..1..0....2..0..0..1....0..2..0..2....1..1..2..1
%e A187645 ..2..1..2..1....2..1..1..2....1..1..2..1....2..1..2..0....2..0..1..0
%e A187645 ..1..1..0..1....1..1..1..1....1..0..2..2....1..0..1..1....0..0..2..2
%e A187645 ..0..1..1..1....0..2..0..0....1..1..0..0....0..2..0..2....0..2..2..0
%K A187645 nonn,tabl
%O A187645 1,1
%A A187645 _R. H. Hardin_ Mar 12 2011