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.

A275401 T(n,k)=Number of nXk 0..2 arrays with no element equal to any value at offset (-2,-1) (-2,0) or (-1,1) and new values introduced in order 0..2.

This page as a plain text file.
%I A275401 #4 Jul 26 2016 14:54:00
%S A275401 1,2,2,5,9,3,14,54,16,6,41,324,84,31,12,122,1944,444,178,63,24,365,
%T A275401 11664,2344,1011,394,129,48,1094,69984,12376,5758,2404,1017,260,96,
%U A275401 3281,419904,65344,32771,14884,8122,2645,534,192,9842,2519424,345008,186538,91849
%N A275401 T(n,k)=Number of nXk 0..2 arrays with no element equal to any value at offset (-2,-1) (-2,0) or (-1,1) and new values introduced in order 0..2.
%C A275401 Table starts
%C A275401 ...1....2.....5......14.......41.......122.........365.........1094
%C A275401 ...2....9....54.....324.....1944.....11664.......69984.......419904
%C A275401 ...3...16....84.....444.....2344.....12376.......65344.......345008
%C A275401 ...6...31...178....1011.....5758.....32771......186538......1061795
%C A275401 ..12...63...394....2404....14884.....91849......566331......3495079
%C A275401 ..24..129..1017....8122....65045....518049.....4142271.....33102260
%C A275401 ..48..260..2645...27373...283169...2940064....30551417....317215507
%C A275401 ..96..534..6980...94065..1266905..17159883...232200615...3146508594
%C A275401 .192.1083.18464..323306..5656712.100110527..1766745035..31272546310
%C A275401 .384.2210.48959.1109170.25396322.587134035.13518543301.312946900074
%H A275401 R. H. Hardin, <a href="/A275401/b275401.txt">Table of n, a(n) for n = 1..243</a>
%F A275401 Empirical for column k:
%F A275401 k=1: a(n) = 2*a(n-1) for n>3
%F A275401 k=2: [order 9] for n>10
%F A275401 k=3: [order 24] for n>28
%F A275401 k=4: [order 65] for n>69
%F A275401 Empirical for row n:
%F A275401 n=1: a(n) = 4*a(n-1) -3*a(n-2)
%F A275401 n=2: a(n) = 6*a(n-1) for n>2
%F A275401 n=3: a(n) = 4*a(n-1) +6*a(n-2) +4*a(n-3)
%F A275401 n=4: a(n) = 3*a(n-1) +11*a(n-2) +25*a(n-3) +2*a(n-4) -24*a(n-5) for n>6
%F A275401 n=5: [order 9] for n>10
%F A275401 n=6: [order 16] for n>17
%F A275401 n=7: [order 21] for n>22
%e A275401 Some solutions for n=4 k=4
%e A275401 ..0..1..1..1. .0..0..1..1. .0..0..0..1. .0..1..1..2. .0..1..0..0
%e A275401 ..2..2..0..1. .2..2..0..0. .1..2..2..0. .0..0..0..0. .0..2..1..1
%e A275401 ..1..2..2..2. .1..2..2..0. .1..1..1..2. .1..2..2..0. .1..2..2..1
%e A275401 ..1..0..1..2. .1..1..1..1. .0..0..0..1. .1..1..1..2. .1..1..0..0
%Y A275401 Column 1 is A003945(n-2).
%Y A275401 Row 1 is A007051(n-1).
%K A275401 nonn,tabl
%O A275401 1,2
%A A275401 _R. H. Hardin_, Jul 26 2016