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-6 of 6 results.

A326100 Number of nX3 0..1 arrays with every element equal to 0, 1, 2, 3 or 6 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.

Original entry on oeis.org

4, 29, 161, 929, 5383, 31236, 181227, 1051456, 6100399, 35393679, 205349281, 1191408438, 6912388772, 40104734047, 232682180647, 1349990181408, 7832458355125, 45442851903417, 263653210203742, 1529679858088141
Offset: 1

Views

Author

R. H. Hardin, Jun 06 2019

Keywords

Comments

Column 3 of A326105.

Examples

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

Crossrefs

Cf. A326105.

Formula

Empirical: a(n) = 5*a(n-1) +5*a(n-2) -2*a(n-3) -3*a(n-6) -2*a(n-7) -a(n-8) -a(n-9)

A326101 Number of nX4 0..1 arrays with every element equal to 0, 1, 2, 3 or 6 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.

Original entry on oeis.org

8, 108, 929, 8628, 81088, 760989, 7140349, 67004116, 628759699, 5900226292, 55367209521, 519561060022, 4875515579106, 45751412134945, 429327253573823, 4028769432048059, 37805620308254748, 354764637439887326
Offset: 1

Views

Author

R. H. Hardin, Jun 06 2019

Keywords

Comments

Column 4 of A326105.

Examples

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

Crossrefs

Cf. A326105.

Formula

Empirical: a(n) = 9*a(n-1) +6*a(n-2) -25*a(n-3) +20*a(n-4) +45*a(n-5) -90*a(n-6) -223*a(n-7) -120*a(n-8) -31*a(n-9) +380*a(n-10) +330*a(n-11) -63*a(n-12) +1212*a(n-13) +225*a(n-14) +584*a(n-15) +203*a(n-16) +317*a(n-17) +57*a(n-18) +86*a(n-19) -5*a(n-20) +4*a(n-21) -4*a(n-22)

A326102 Number of nX5 0..1 arrays with every element equal to 0, 1, 2, 3 or 6 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.

Original entry on oeis.org

16, 401, 5383, 81088, 1233763, 18773244, 285501774, 4342306378, 66044562508, 1004511268426, 15278201929483, 232375115724566, 3534329117779729, 53755680560634333, 817601615564449061, 12435381613691660830
Offset: 1

Views

Author

R. H. Hardin, Jun 06 2019

Keywords

Comments

Column 5 of A326105.

Examples

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

Crossrefs

Cf. A326105.

Formula

Empirical: a(n) = 17*a(n-1) -25*a(n-2) -81*a(n-3) +812*a(n-4) -1312*a(n-5) -2865*a(n-6) +8714*a(n-7) -66*a(n-8) -43033*a(n-9) -125505*a(n-10) +484471*a(n-11) -255789*a(n-12) -1486727*a(n-13) +3227987*a(n-14) -2598295*a(n-15) -5412191*a(n-16) -47680568*a(n-17) +79979948*a(n-18) +86671801*a(n-19) -262784969*a(n-20) +154305396*a(n-21) -466723959*a(n-22) +959658755*a(n-23) -507585219*a(n-24) +701844263*a(n-25) -889593201*a(n-26) +1536321229*a(n-27) +420363180*a(n-28) +210081684*a(n-29) +253587140*a(n-30) -170890206*a(n-31) +868138535*a(n-32) -51102373*a(n-33) -290450507*a(n-34) -269814180*a(n-35) -497784439*a(n-36) +681316694*a(n-37) -486030089*a(n-38) -192346791*a(n-39) +276312944*a(n-40) -120006865*a(n-41) +66180671*a(n-42) +10458443*a(n-43) -18480207*a(n-44) +38629305*a(n-45) -20808715*a(n-46) -2771235*a(n-47) +11529381*a(n-48) -9539660*a(n-49) +3061661*a(n-50) -307556*a(n-51) -440685*a(n-52) +503602*a(n-53) -278717*a(n-54) +105571*a(n-55) -32382*a(n-56) +9813*a(n-57) -1664*a(n-58) +44*a(n-59) for n>60

A326103 Number of n X 6 0..1 arrays with every element equal to 0, 1, 2, 3 or 6 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.

Original entry on oeis.org

32, 1490, 31236, 760989, 18773244, 463572941, 11436374461, 282167817331, 6962226034753, 171787008588901, 4238685186296128, 104585591946513522, 2580551863305980286, 63672711174351036656, 1571064779126332424276
Offset: 1

Views

Author

R. H. Hardin, Jun 06 2019

Keywords

Comments

Column 6 of A326105.

Examples

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

Crossrefs

Cf. A326105.

A326104 Number of nX7 0..1 arrays with every element equal to 0, 1, 2, 3 or 6 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.

Original entry on oeis.org

64, 5536, 181227, 7140349, 285501774, 11436374461, 457515856087, 18304957522469, 732434052866467, 29307016828624452, 1172658992868162369, 46921473708684800557, 1877464197930752217833, 75122790849233220662502
Offset: 1

Views

Author

R. H. Hardin, Jun 06 2019

Keywords

Comments

Column 7 of A326105.

Examples

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

Crossrefs

Cf. A326105.

A326099 Number of nXn 0..1 arrays with every element equal to 0, 1, 2, 3 or 6 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.

Original entry on oeis.org

1, 8, 161, 8628, 1233763, 463572941, 457515856087, 1187662505828132, 8109848158608706092, 145652282125715208618002, 6879822326742091298103753274
Offset: 1

Views

Author

R. H. Hardin, Jun 06 2019

Keywords

Comments

Diagonal of A326105.

Examples

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

Crossrefs

Cf. A326105.
Showing 1-6 of 6 results.