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-10 of 11 results. Next

A303192 Number of nX3 0..1 arrays with every element equal to 0, 1, 3, 5 or 6 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.

Original entry on oeis.org

3, 9, 12, 23, 62, 122, 305, 793, 1757, 4500, 11625, 27164, 68288, 174229, 418787, 1042345, 2631836, 6422387, 15922406, 39917606, 98193097, 243159537, 606853585, 1499009192, 3711839149, 9238182444, 22867354964, 56640304965, 140740151139
Offset: 1

Views

Author

R. H. Hardin, Apr 19 2018

Keywords

Comments

Column 3 of A303197.

Examples

			Some solutions for n=5
..0..1..0. .0..1..0. .0..1..1. .0..1..1. .0..1..0. .0..1..0. .0..0..1
..0..0..0. .1..1..0. .0..0..0. .0..0..0. .0..1..1. .0..1..0. .1..1..1
..0..1..0. .0..1..0. .0..1..0. .0..1..0. .1..1..1. .0..0..0. .1..0..1
..1..1..0. .0..1..0. .0..1..1. .0..1..0. .0..1..0. .0..1..0. .1..0..0
..0..1..0. .0..1..0. .0..1..0. .0..1..0. .1..0..0. .0..1..0. .1..0..1
		

Crossrefs

Cf. A303197.

Formula

Empirical: a(n) = 2*a(n-1) -a(n-2) +11*a(n-3) -15*a(n-4) +6*a(n-5) -10*a(n-6) +6*a(n-7) for n>11

A303193 Number of nX4 0..1 arrays with every element equal to 0, 1, 3, 5 or 6 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.

Original entry on oeis.org

5, 17, 23, 46, 185, 497, 1357, 4207, 12167, 34473, 102325, 299504, 863917, 2529911, 7401255, 21512919, 62790998, 183429084, 534568781, 1559375192, 4551720900, 13275818353, 38726475676, 113002176247, 329660705673, 961703508351
Offset: 1

Views

Author

R. H. Hardin, Apr 19 2018

Keywords

Comments

Column 4 of A303197.

Examples

			Some solutions for n=5
..0..1..0..1. .0..1..0..1. .0..1..1..0. .0..1..0..1. .0..1..0..1
..0..1..0..1. .0..1..0..1. .0..1..0..1. .0..0..0..1. .0..1..1..1
..0..0..0..1. .0..1..0..1. .0..1..0..1. .0..1..0..1. .0..1..0..1
..0..1..1..1. .0..1..1..1. .0..1..1..1. .0..1..1..1. .0..1..0..1
..0..1..0..1. .0..1..0..0. .0..0..0..1. .0..0..0..1. .0..0..1..1
		

Crossrefs

Cf. A303197.

Formula

Empirical: a(n) = 2*a(n-1) +2*a(n-2) +12*a(n-3) -16*a(n-4) -31*a(n-5) -40*a(n-6) +26*a(n-7) +53*a(n-8) +50*a(n-9) +35*a(n-10) +7*a(n-11) +a(n-12) -66*a(n-13) +111*a(n-14) +160*a(n-15) -144*a(n-16) -293*a(n-17) -37*a(n-18) +236*a(n-19) -90*a(n-20) -395*a(n-21) -6*a(n-22) +127*a(n-23) -242*a(n-24) -440*a(n-25) -17*a(n-26) +448*a(n-27) +310*a(n-28) +44*a(n-29) +97*a(n-30) +113*a(n-31) -8*a(n-32) -125*a(n-33) -100*a(n-34) -26*a(n-35) -a(n-36) +15*a(n-37) +10*a(n-38) +9*a(n-39) -a(n-41) -a(n-42) for n>43

A303194 Number of nX5 0..1 arrays with every element equal to 0, 1, 3, 5 or 6 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.

Original entry on oeis.org

8, 25, 43, 97, 523, 1751, 5573, 21575, 76833, 266179, 971949, 3482591, 12336431, 44409867, 159182895, 567732335, 2035296081, 7291955435, 26069806559, 93348365103, 334298657839, 1196193957779, 4282016007317, 15330901431591
Offset: 1

Views

Author

R. H. Hardin, Apr 19 2018

Keywords

Comments

Column 5 of A303197.

Examples

			Some solutions for n=5
..0..1..0..1..0. .0..1..0..1..0. .0..1..0..0..1. .0..1..0..0..1
..0..0..0..1..0. .0..0..0..1..0. .0..1..0..1..0. .1..0..0..0..0
..1..1..0..1..0. .0..1..0..1..0. .0..1..0..1..0. .1..0..1..0..1
..1..0..1..0..0. .0..1..0..1..1. .0..1..0..0..1. .1..0..1..0..0
..1..0..1..1..1. .1..0..0..1..0. .0..0..1..0..1. .1..0..1..0..1
		

Crossrefs

Cf. A303197.

Formula

Empirical: a(n) = 2*a(n-1) +a(n-2) +42*a(n-3) -52*a(n-4) -36*a(n-5) -601*a(n-6) +494*a(n-7) +501*a(n-8) +3674*a(n-9) -2252*a(n-10) -3728*a(n-11) -9746*a(n-12) +7102*a(n-13) +11972*a(n-14) +9668*a(n-15) -12696*a(n-16) -18552*a(n-17) -2516*a(n-18) +14464*a(n-19) +17480*a(n-20) +2144*a(n-21) -23696*a(n-22) -4528*a(n-23) +3152*a(n-24) +13280*a(n-25) -7136*a(n-26) -768*a(n-27) +7936*a(n-28) +768*a(n-29) +384*a(n-30) -5120*a(n-31) -256*a(n-32) +2048*a(n-33) for n>37

A303195 Number of nX6 0..1 arrays with every element equal to 0, 1, 3, 5 or 6 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.

Original entry on oeis.org

13, 65, 105, 283, 2106, 8250, 32223, 159440, 703465, 2973340, 13494853, 60180498, 262407902, 1167392813, 5190322216, 22874608873, 101334971043, 449454168985, 1987423197338, 8798329818980, 38980239305306, 172530975264447
Offset: 1

Views

Author

R. H. Hardin, Apr 19 2018

Keywords

Comments

Column 6 of A303197.

Examples

			Some solutions for n=5
..0..1..0..0..0..1. .0..1..0..1..1..1. .0..1..0..1..0..1. .0..1..0..1..1..0
..0..1..1..1..0..1. .0..1..0..0..0..1. .0..0..0..1..1..1. .1..1..0..1..0..1
..1..1..1..1..1..1. .0..1..0..1..0..1. .0..1..0..1..0..1. .0..1..0..1..0..1
..0..1..0..1..0..1. .1..0..0..0..1..0. .0..1..0..1..0..1. .0..1..0..1..1..1
..0..0..1..1..0..1. .1..0..1..1..1..0. .0..1..0..1..1..0. .1..0..0..1..0..1
		

Crossrefs

Cf. A303197.

A303196 Number of n X 7 0..1 arrays with every element equal to 0, 1, 3, 5 or 6 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.

Original entry on oeis.org

21, 185, 233, 687, 7425, 34801, 164295, 1053249, 5803057, 30459340, 175958088, 988572609, 5409436965, 30475463803, 171059829077, 949886716408, 5320086247758, 29806428448927, 166317770692219, 930326534497792
Offset: 1

Views

Author

R. H. Hardin, Apr 19 2018

Keywords

Comments

Column 7 of A303197.

Examples

			Some solutions for n=5
..0..1..0..1..1..0..1. .0..1..1..0..1..0..1. .0..1..0..0..1..0..1
..0..1..1..0..1..0..1. .1..0..1..0..1..1..1. .0..1..1..1..1..0..1
..1..1..1..1..1..1..1. .1..0..1..0..1..0..0. .0..1..0..1..0..1..1
..1..1..1..1..1..0..1. .1..0..0..1..1..1..1. .0..1..0..0..1..0..1
..0..1..1..0..0..0..1. .1..1..1..1..1..0..1. .0..1..1..1..1..0..1
		

Crossrefs

Cf. A303197.

A303198 Number of 3Xn 0..1 arrays with every element equal to 0, 1, 3, 5 or 6 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.

Original entry on oeis.org

4, 6, 12, 23, 43, 105, 233, 479, 968, 2146, 4683, 9928, 20709, 44652, 96244, 205631, 435063, 930935, 1994977, 4266607, 9080728, 19396626, 41471567, 88657284, 189124509, 403873550, 862832200, 1843730503, 3936307111, 8406314159
Offset: 1

Views

Author

R. H. Hardin, Apr 19 2018

Keywords

Comments

Row 3 of A303197.

Examples

			Some solutions for n=5
..0..0..1..0..1. .0..1..0..1..0. .0..1..0..1..1. .0..1..1..1..0
..0..1..0..0..1. .0..1..0..0..0. .1..1..0..0..0. .0..1..0..0..0
..0..1..0..1..0. .0..1..0..1..0. .0..1..0..1..0. .0..1..0..1..0
		

Crossrefs

Cf. A303197.

Formula

Empirical: a(n) = a(n-1) +a(n-2) +12*a(n-4) -6*a(n-5) -7*a(n-6) -3*a(n-7) -26*a(n-8) +9*a(n-9) +14*a(n-10) +5*a(n-11) +18*a(n-12) -5*a(n-13) -9*a(n-14) -2*a(n-15) -3*a(n-16) +a(n-17) +a(n-18) for n>19

A303199 Number of 4Xn 0..1 arrays with every element equal to 0, 1, 3, 5 or 6 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.

Original entry on oeis.org

8, 10, 23, 46, 97, 283, 687, 1642, 3949, 10169, 25010, 60900, 149264, 373120, 920574, 2259062, 5562698, 13784985, 34019145, 83759406, 206523981, 510324559, 1259274155, 3104524302, 7657989177, 18904333224, 46644705875, 115050987507
Offset: 1

Views

Author

R. H. Hardin, Apr 19 2018

Keywords

Comments

Row 4 of A303197.

Examples

			Some solutions for n=5
..0..0..1..1..0. .0..1..0..0..0. .0..1..0..1..0. .0..1..0..0..1
..0..1..0..1..0. .0..1..0..1..1. .0..1..0..1..0. .1..1..0..1..0
..0..1..0..1..0. .0..0..1..0..1. .1..1..0..1..0. .0..1..0..1..0
..0..1..0..0..1. .1..1..1..0..1. .0..1..0..0..1. .0..1..0..0..1
		

Crossrefs

Cf. A303197.

Formula

Empirical: a(n) = a(n-1) +3*a(n-2) +2*a(n-3) +28*a(n-4) -31*a(n-5) -90*a(n-6) -44*a(n-7) -283*a(n-8) +376*a(n-9) +1008*a(n-10) +311*a(n-11) +1386*a(n-12) -2347*a(n-13) -6108*a(n-14) -872*a(n-15) -3347*a(n-16) +8856*a(n-17) +23769*a(n-18) -123*a(n-19) +1195*a(n-20) -22117*a(n-21) -64764*a(n-22) +7147*a(n-23) +19461*a(n-24) +38840*a(n-25) +127932*a(n-26) -21682*a(n-27) -74830*a(n-28) -50864*a(n-29) -183540*a(n-30) +36739*a(n-31) +157510*a(n-32) +54333*a(n-33) +187390*a(n-34) -42853*a(n-35) -222777*a(n-36) -53364*a(n-37) -129121*a(n-38) +39540*a(n-39) +223618*a(n-40) +49370*a(n-41) +50470*a(n-42) -32833*a(n-43) -162219*a(n-44) -37859*a(n-45) +76*a(n-46) +24074*a(n-47) +85250*a(n-48) +21014*a(n-49) -12817*a(n-50) -13251*a(n-51) -31994*a(n-52) -7827*a(n-53) +7830*a(n-54) +4713*a(n-55) +8220*a(n-56) +1874*a(n-57) -2410*a(n-58) -960*a(n-59) -1329*a(n-60) -278*a(n-61) +404*a(n-62) +95*a(n-63) +116*a(n-64) +24*a(n-65) -33*a(n-66) -3*a(n-67) -4*a(n-68) -a(n-69) +a(n-70) for n>71

A303200 Number of 5Xn 0..1 arrays with every element equal to 0, 1, 3, 5 or 6 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.

Original entry on oeis.org

16, 21, 62, 185, 523, 2106, 7425, 23976, 77199, 278516, 970352, 3224100, 10748487, 37400625, 128931566, 434968863, 1468892487, 5046611020, 17300239256, 58747284770, 199467828264, 682129604278, 2332060352220, 7940005050689
Offset: 1

Views

Author

R. H. Hardin, Apr 19 2018

Keywords

Comments

Row 5 of A303197.

Examples

			Some solutions for n=5
..0..0..1..1..0. .0..1..0..0..1. .0..1..0..1..0. .0..1..1..0..1
..0..1..0..1..0. .0..1..0..1..0. .0..0..0..1..1. .1..0..1..0..1
..0..1..0..1..0. .0..1..0..1..0. .0..1..1..1..1. .1..0..1..0..1
..0..0..0..1..1. .1..0..0..1..0. .0..1..0..1..0. .0..1..1..0..1
..1..1..0..1..0. .1..0..1..0..0. .0..1..0..0..1. .0..1..0..1..1
		

Crossrefs

Cf. A303197.

A303201 Number of 6Xn 0..1 arrays with every element equal to 0, 1, 3, 5 or 6 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.

Original entry on oeis.org

32, 42, 122, 497, 1751, 8250, 34801, 138014, 547379, 2363422, 9950923, 40646071, 165726180, 698032757, 2923119363, 12072924913, 49765448651, 207852058476, 867405410380, 3597782646113, 14902213961792, 62057837398724
Offset: 1

Views

Author

R. H. Hardin, Apr 19 2018

Keywords

Comments

Row 6 of A303197.

Examples

			Some solutions for n=5
..0..1..0..0..1. .0..1..1..0..0. .0..0..0..1..0. .0..0..1..0..1
..1..1..0..1..0. .0..1..0..1..0. .0..1..1..1..0. .1..1..1..0..1
..0..1..0..1..0. .0..1..0..1..0. .0..1..0..1..0. .1..0..1..0..1
..0..1..0..1..1. .0..0..0..1..0. .0..1..0..1..0. .0..0..1..0..1
..0..0..0..1..0. .0..1..1..1..0. .0..0..0..1..0. .1..0..1..0..1
..1..1..0..1..0. .0..1..0..1..0. .0..1..0..1..0. .1..0..1..0..1
		

Crossrefs

Cf. A303197.

A303202 Number of 7Xn 0..1 arrays with every element equal to 0, 1, 3, 5 or 6 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.

Original entry on oeis.org

64, 86, 305, 1357, 5573, 32223, 164295, 791150, 3806973, 20061588, 102569116, 509264634, 2533233396, 13009655163, 66295486978, 333341116143, 1676598847494, 8537179144591, 43394714360416, 219303340502779, 1108007577865676
Offset: 1

Views

Author

R. H. Hardin, Apr 19 2018

Keywords

Comments

Row 7 of A303197.

Examples

			Some solutions for n=5
..0..1..1..0..1. .0..1..0..1..0. .0..1..0..1..0. .0..1..1..0..1
..1..1..1..1..0. .1..1..0..0..0. .1..1..0..1..1. .1..1..1..1..0
..1..1..1..1..1. .0..1..0..1..0. .0..1..0..1..0. .1..1..1..1..1
..0..1..1..1..1. .0..1..0..1..1. .0..1..0..1..0. .1..1..1..1..1
..0..1..0..1..1. .0..1..0..1..0. .1..1..0..0..0. .0..1..1..1..1
..0..1..0..1..0. .0..1..0..1..0. .0..1..0..1..0. .1..0..1..1..0
..1..0..0..1..0. .0..1..0..0..1. .0..1..0..1..0. .1..0..1..0..1
		

Crossrefs

Cf. A303197.
Showing 1-10 of 11 results. Next