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.

A208069 T(n,k)=Number of nXk 0..1 arrays avoiding 0 0 0 and 1 1 1 horizontally and 0 0 1 and 0 1 1 vertically.

Original entry on oeis.org

2, 4, 4, 6, 16, 6, 10, 36, 36, 9, 16, 100, 72, 81, 12, 26, 256, 240, 144, 144, 16, 42, 676, 704, 576, 216, 256, 20, 68, 1764, 2080, 1936, 1008, 324, 400, 25, 110, 4624, 6216, 6400, 3696, 1764, 432, 625, 30, 178, 12100, 18496, 21904, 12960, 7056, 2688, 576, 900, 36
Offset: 1

Views

Author

R. H. Hardin Feb 23 2012

Keywords

Comments

Table starts
..2...4...6...10....16....26.....42......68.....110......178.......288
..4..16..36..100...256...676...1764....4624...12100....31684.....82944
..6..36..72..240...704..2080...6216...18496...55000...163760....487296
..9..81.144..576..1936..6400..21904...73984..250000...846400...2862864
.12.144.216.1008..3696.12960..48840..179520..657000..2423280...8913456
.16.256.324.1764..7056.26244.108900..435600.1726596..6937956..27751824
.20.400.432.2688.11424.44064.198000..844800.3542544.15213984..64859616
.25.625.576.4096.18496.73984.360000.1638400.7268416.33362176.151585344

Examples

			Some solutions for n=4 k=3
..0..0..1....0..1..0....1..1..0....1..1..0....0..1..0....1..1..0....1..0..0
..0..1..1....1..0..1....1..0..1....1..1..0....0..0..1....1..1..0....0..0..1
..0..0..1....0..1..0....1..0..0....1..1..0....0..1..0....1..0..0....1..0..0
..0..1..0....1..0..0....0..0..1....1..1..0....0..0..1....1..1..0....0..0..1
		

Crossrefs

Column 1 is A002620(n+2)
Column 2 is A030179(n+2)
Row 1 is A006355(n+2)
Row 2 is A206981
Row 3 is A207840
Row 4 is A207924