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.

Showing 1-4 of 4 results.

A222878 T(n,k)=Number of nXk 0..3 arrays with no more than floor(nXk/2) elements equal to at least one horizontal or antidiagonal neighbor, with new values introduced in row major 0..3 order.

Original entry on oeis.org

1, 1, 2, 2, 11, 5, 11, 122, 131, 15, 34, 1814, 6282, 2150, 51, 131, 26311, 409775, 443510, 32491, 187, 438, 399849, 19707855, 95867967, 23794078, 533186, 715, 2150, 6013669, 1340197778, 20978414941, 22794825314, 1698174722, 8362152, 2795, 7676
Offset: 1

Views

Author

R. H. Hardin Mar 08 2013

Keywords

Comments

Table starts
.....1..........1...............2...................11......................34
.....2.........11.............122.................1814...................26311
.....5........131............6282...............409775................19707855
....15.......2150..........443510.............95867967.............20978414941
....51......32491........23794078..........22794825314..........16473931317022
...187.....533186......1698174722........5472896849943.......17791003053622809
...715....8362152.....93656293632.....1322676376672081....14337592109053271558
..2795..135650378...6637413406814...321195816580955511.15577784123509878927189
.11051.2155759835.372075279639542.78284744747263499257

Examples

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

Crossrefs

Column 1 is A007581(n-1)
Row 1 is A222650

A223041 T(n,k)=Number of nXk 0..3 arrays with no more than floor(nXk/2) elements equal to at least one horizontal, diagonal or antidiagonal neighbor, with new values introduced in row major 0..3 order.

Original entry on oeis.org

1, 1, 2, 2, 8, 5, 11, 98, 105, 15, 34, 1265, 3780, 1585, 51, 131, 17356, 229437, 255943, 23107, 187, 438, 241583, 8580619, 42964721, 10904199, 353631, 715, 2150, 3395532, 545607733, 7361951209, 8206670940, 751990800, 5338646, 2795, 7676, 48048796
Offset: 1

Views

Author

R. H. Hardin Mar 12 2013

Keywords

Comments

Table starts
.....1........1...........2............11............34...........131
.....2........8..........98..........1265.........17356........241583
.....5......105........3780........229437.......8580619.....545607733
....15.....1585......255943......42964721....7361951209.1278533695058
....51....23107....10904199....8206670940.3829674402996
...187...353631...751990800.1590576924149
...715..5338646.33007705273
..2795.81874696
.11051

Examples

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

Crossrefs

Column 1 is A007581(n-1)
Column 2 is A222839
Row 1 is A222650

A222828 T(n,k)=Number of nXk 0..3 arrays with no more than floor(nXk/2) elements equal to at least one horizontal, vertical or antidiagonal neighbor, with new values introduced in row major 0..3 order.

Original entry on oeis.org

1, 1, 1, 2, 8, 2, 11, 80, 80, 11, 34, 1154, 2695, 1154, 34, 131, 14388, 163059, 163059, 14388, 131, 438, 200082, 4990235, 23664739, 4990235, 200082, 438, 2150, 2652496, 324288311, 3489313607, 3489313607, 324288311, 2652496, 2150, 7676, 36622104
Offset: 1

Views

Author

R. H. Hardin Mar 06 2013

Keywords

Comments

Table starts
.....1.........1............2.............11..............34.............131
.....1.........8...........80...........1154...........14388..........200082
.....2........80.........2695.........163059.........4990235.......324288311
....11......1154.......163059.......23664739......3489313607....520160675223
....34.....14388......4990235.....3489313607...1138373246058.835207158093802
...131....200082....324288311...520160675223.835207158093802
...438...2652496..10170499564.78214529020708
..2150..36622104.674288738013
..7676.498427856
.32491

Examples

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

Crossrefs

Column 1 is A222650

A222842 T(n,k) is the number of n X k 0..3 arrays with no more than floor(n*k/2) elements equal to at least one horizontal or vertical neighbor, with new values introduced in row major 0..3 order.

Original entry on oeis.org

1, 1, 1, 2, 8, 2, 11, 105, 105, 11, 34, 1585, 4797, 1585, 34, 131, 23107, 326408, 326408, 23107, 131, 438, 353631, 15364848, 70144361, 15364848, 353631, 438, 2150, 5338646, 1077545438, 15371324917, 15371324917, 1077545438, 5338646, 2150, 7676
Offset: 1

Views

Author

R. H. Hardin, Mar 06 2013

Keywords

Comments

Table starts:
.....1..........1.............2..............11................34
.....1..........8...........105............1585.............23107
.....2........105..........4797..........326408..........15364848
....11.......1585........326408........70144361.......15371324917
....34......23107......15364848.....15371324917....10720259944904
...131.....353631....1077545438...3410802057085.11000375151330544
...438....5338646...52487425596.763478480305913
..2150...81874696.3689615795056
..7676.1252153841
.32491

Examples

			Some solutions for n=3 and k=4:
..0..1..0..2....0..1..0..1....0..1..0..2....0..1..0..0....0..1..1..2
..3..0..3..2....1..2..1..0....0..0..2..2....2..2..0..1....1..0..2..3
..2..1..3..0....0..1..2..2....2..1..0..3....3..0..1..0....0..1..2..3
		

Crossrefs

Columns 1..4 are A222650, A222839, A222840, A222841.
Showing 1-4 of 4 results.