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.

A217999 T(n,k)=Number of nXk arrays of the minimum or maximum value of corresponding elements and their horizontal and vertical neighbors in a random 0..2 nXk array.

This page as a plain text file.
%I A217999 #6 Jul 22 2025 23:46:32
%S A217999 3,9,9,25,81,25,81,729,729,81,241,6561,19665,6561,241,719,59049,
%T A217999 531143,531143,59049,719,2181,531441,14345273,43046713,14345273,
%U A217999 531441,2181,6543,4782969,387332417,3486751263,3486751263,387332417,4782969,6543
%N A217999 T(n,k)=Number of nXk arrays of the minimum or maximum value of corresponding elements and their horizontal and vertical neighbors in a random 0..2 nXk array.
%C A217999 Table starts
%C A217999 .....3........9..........25...........81..........241..........719
%C A217999 .....9.......81.........729.........6561........59049.......531441
%C A217999 ....25......729.......19665.......531143.....14345273....387332417
%C A217999 ....81.....6561......531143.....43046713...3486751263.282429513233
%C A217999 ...241....59049....14345273...3486751263.847279307713
%C A217999 ...719...531441...387332417.282429513233
%C A217999 ..2181..4782969.10458051407
%C A217999 ..6543.43046721
%C A217999 .19623
%H A217999 R. H. Hardin, <a href="/A217999/b217999.txt">Table of n, a(n) for n = 1..49</a>
%e A217999 Some solutions for n=3 k=4
%e A217999 ..0..2..2..0....0..2..2..2....0..2..1..1....0..0..0..2....0..1..0..2
%e A217999 ..1..0..2..0....0..2..0..0....1..2..0..1....0..1..1..0....0..0..1..2
%e A217999 ..1..0..0..0....0..2..2..0....1..1..0..1....2..2..0..0....2..0..2..1
%Y A217999 Column 2 is 9^n, A001019
%K A217999 nonn,tabl
%O A217999 1,1
%A A217999 _R. H. Hardin_ Oct 17 2012