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 12 results. Next

A218586 Hilltop maps: number of n X n binary arrays indicating the locations of corresponding elements not exceeded by any horizontal or antidiagonal neighbor in a random 0..2 n X n array.

Original entry on oeis.org

1, 13, 449, 56629, 28543403, 57707873919, 467122877883141, 15124271280844676313, 1958173356335852318774549, 1013875932726564267833657180687
Offset: 1

Views

Author

R. H. Hardin Nov 03 2012

Keywords

Comments

Diagonal of A218592

Examples

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

A218587 Hilltop maps: number of n X 3 binary arrays indicating the locations of corresponding elements not exceeded by any horizontal or antidiagonal neighbor in a random 0..2 n X 3 array.

Original entry on oeis.org

7, 57, 449, 3567, 28305, 224643, 1782855, 14149449, 112295673, 891223263, 7073103393, 56134970523, 445509522567, 3535741318617, 28061053779825, 222703718478543, 1767465563243697, 14027311885918707, 111326343684867783
Offset: 1

Views

Author

R. H. Hardin, Nov 03 2012

Keywords

Comments

Column 3 of A218592.

Examples

			Some solutions for n=3:
..1..0..0....0..1..1....1..0..1....0..1..0....1..1..1....1..1..1....1..1..1
..0..1..0....0..1..1....0..0..1....1..1..1....0..1..0....0..1..1....0..0..1
..1..1..1....0..1..0....1..0..1....0..0..0....0..1..1....0..0..0....1..0..1
		

Crossrefs

Cf. A218592.

Formula

Empirical: a(n) = 7*a(n-1) + 7*a(n-2) + 3*a(n-3) + 3*a(n-4) + 3*a(n-5).
Empirical g.f.: x*(7 + 8*x + x^2 + 4*x^3 + x^4) / (1 - 7*x - 7*x^2 - 3*x^3 - 3*x^4 - 3*x^5). - Colin Barker, Jul 24 2018

A218588 Hilltop maps: number of nX4 binary arrays indicating the locations of corresponding elements not exceeded by any horizontal or antidiagonal neighbor in a random 0..2 nX4 array.

Original entry on oeis.org

13, 225, 3565, 56629, 900213, 14309253, 227451273, 3615431533, 57468767413, 913489632033, 14520292432269, 230806004700461, 3668756125551981, 58316383606459589, 926962839870918025, 14734454596844709749
Offset: 1

Views

Author

R. H. Hardin Nov 03 2012

Keywords

Comments

Column 4 of A218592

Examples

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

Formula

Empirical: a(n) = 13*a(n-1) +40*a(n-2) +92*a(n-3) +58*a(n-4) +30*a(n-5) -72*a(n-6) +4*a(n-7) -13*a(n-8) +9*a(n-9)

A218589 Hilltop maps: number of nX5 binary arrays indicating the locations of corresponding elements not exceeded by any horizontal or antidiagonal neighbor in a random 0..2 nX5 array.

Original entry on oeis.org

25, 895, 28325, 898763, 28543403, 906390787, 28782653703, 913998678577, 29024205558587, 921669292406117, 29267787550042425, 929404283528404253, 29513413706384880845, 937204189864632464075, 29761101248357058984601
Offset: 1

Views

Author

R. H. Hardin Nov 03 2012

Keywords

Comments

Column 5 of A218592

Examples

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

Formula

Empirical: a(n) = 24*a(n-1) +208*a(n-2) +1118*a(n-3) +2907*a(n-4) +5536*a(n-5) +5083*a(n-6) +5846*a(n-7) -1439*a(n-8) +240*a(n-9) +351*a(n-10) -86*a(n-11) -1083*a(n-12) -56*a(n-13) +5*a(n-14) -238*a(n-15) -15*a(n-18) for n>19

A218590 Hilltop maps: number of nX6 binary arrays indicating the locations of corresponding elements not exceeded by any horizontal or antidiagonal neighbor in a random 0..2 nX6 array.

Original entry on oeis.org

49, 3565, 225647, 14313773, 908914463, 57707873919, 3663996495065, 232634494299223, 14770432493750847, 937804521455278797, 59543098444313115311, 3780511282396595054063, 240032277959119287777081
Offset: 1

Views

Author

R. H. Hardin Nov 03 2012

Keywords

Comments

Column 6 of A218592

Examples

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

Formula

Empirical: a(n) = 49*a(n-1) +784*a(n-2) +8032*a(n-3) +36736*a(n-4) +128672*a(n-5) +113364*a(n-6) +604540*a(n-7) -442768*a(n-8) +1552544*a(n-9) -2352736*a(n-10) +1296064*a(n-11) -920054*a(n-12) +541894*a(n-13) -439824*a(n-14) +294048*a(n-15) -85440*a(n-16) +68256*a(n-17) -16524*a(n-18) +14652*a(n-19) -9072*a(n-20) +864*a(n-21) -864*a(n-22) -81*a(n-24) +81*a(n-25) for n>27

A218591 Hilltop maps: number of nX7 binary arrays indicating the locations of corresponding elements not exceeded by any horizontal or antidiagonal neighbor in a random 0..2 nX7 array.

Original entry on oeis.org

97, 14189, 1798967, 228191491, 28976110305, 3679019688741, 467122877883141, 59310238629598533, 7530575876378444705, 956151509525182089139, 121401831920934712845239, 15414298517143294281162561
Offset: 1

Views

Author

R. H. Hardin Nov 03 2012

Keywords

Comments

Column 7 of A218592

Examples

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

Formula

Empirical: a(n) = 97*a(n-1) +3229*a(n-2) +67623*a(n-3) +662135*a(n-4) +5012349*a(n-5) +14073662*a(n-6) +102254788*a(n-7) -197774330*a(n-8) +699356400*a(n-9) -2086430924*a(n-10) +1575418802*a(n-11) -113841265*a(n-12) -1350570577*a(n-13) +6374137857*a(n-14) -16954790363*a(n-15) +24033834796*a(n-16) -24052990754*a(n-17) +30677592701*a(n-18) -28465330929*a(n-19) +18395816001*a(n-20) -14524792821*a(n-21) +12044876400*a(n-22) -4744942902*a(n-23) +2035841238*a(n-24) -2161783296*a(n-25) +547689762*a(n-26) -35660088*a(n-27) +165258873*a(n-28) -31667031*a(n-29) -9464607*a(n-30) -4218723*a(n-31) +1003833*a(n-32) +531441*a(n-33) for n>36

A218593 Hilltop maps: number of 2Xn binary arrays indicating the locations of corresponding elements not exceeded by any horizontal or antidiagonal neighbor in a random 0..2 2Xn array.

Original entry on oeis.org

1, 13, 57, 225, 895, 3565, 14189, 56489, 224891, 895325, 3564433, 14190565, 56494859, 224914869, 895421261, 3564812065, 14192074291, 56500867089, 224938787413, 895516488309, 3565191179595, 14193583605661, 56506875907213
Offset: 1

Views

Author

R. H. Hardin Nov 03 2012

Keywords

Comments

Row 2 of A218592

Examples

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

Formula

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

A218594 Hilltop maps: number of 3Xn binary arrays indicating the locations of corresponding elements not exceeded by any horizontal or antidiagonal neighbor in a random 0..2 3Xn array.

Original entry on oeis.org

1, 49, 449, 3565, 28325, 225647, 1798967, 14344301, 114371203, 911903915, 7270785113, 57971383761, 462217176543, 3685347946655, 29383999805463, 234284375881311, 1867995138191173, 14893890483791275, 118751901014588395
Offset: 1

Views

Author

R. H. Hardin Nov 03 2012

Keywords

Comments

Row 3 of A218592

Examples

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

Formula

Empirical: a(n) = 7*a(n-1) +5*a(n-2) +17*a(n-3) +24*a(n-4) +118*a(n-5) +51*a(n-6) +119*a(n-7) +146*a(n-8) +278*a(n-9) -139*a(n-10) -27*a(n-11) +74*a(n-12) -248*a(n-13) -419*a(n-14) -247*a(n-15) -75*a(n-16) -11*a(n-17) +348*a(n-18) +172*a(n-19) +37*a(n-20) +37*a(n-21) -71*a(n-22) -71*a(n-23) -38*a(n-24) -16*a(n-25) +9*a(n-26) +21*a(n-27) +18*a(n-28) +14*a(n-29) +7*a(n-30) -a(n-31) -8*a(n-32) -2*a(n-33) +a(n-34) +a(n-35) -a(n-36) -a(n-37) for n>38

A218595 Hilltop maps: number of 4Xn binary arrays indicating the locations of corresponding elements not exceeded by any horizontal or antidiagonal neighbor in a random 0..2 4Xn array.

Original entry on oeis.org

1, 191, 3567, 56629, 898763, 14313773, 228191491, 3638365943, 58007785937, 924827168901, 14744666323421, 235076662350533, 3747866807725781, 59752871465350263, 952650082055322631, 15188260508053833233
Offset: 1

Views

Author

R. H. Hardin Nov 03 2012

Keywords

Comments

Row 4 of A218592

Examples

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

A218596 Hilltop maps: number of 5Xn binary arrays indicating the locations of corresponding elements not exceeded by any horizontal or antidiagonal neighbor in a random 0..2 5Xn array.

Original entry on oeis.org

1, 737, 28305, 900213, 28543403, 908914463, 28976110305, 923902607653, 29456613886229, 939145718670695, 29942165452165937, 954626864774112217, 30435761282996284955, 970364022192333797121, 30937498799139172046789
Offset: 1

Views

Author

R. H. Hardin Nov 03 2012

Keywords

Comments

Row 5 of A218592

Examples

			Some solutions for n=3
..1..1..1....1..0..1....1..0..1....0..1..1....0..0..0....0..1..0....1..0..0
..0..0..0....0..1..1....1..1..1....1..0..0....1..0..0....1..1..1....0..1..0
..0..1..0....0..1..0....0..0..0....0..1..0....0..0..1....1..1..1....1..0..0
..0..1..0....0..0..0....0..0..1....1..1..1....0..1..1....1..1..0....1..0..0
..1..1..0....1..1..1....1..1..1....0..0..1....1..0..0....1..0..0....0..1..1
		
Showing 1-10 of 12 results. Next