A213106 -id:A213106 - cp's OEIS frontend

A213070 Irregular array T(n,k) of the numbers of non-extendable (complete) non-self-adjacent simple paths ending at each of a minimal subset of nodes within a square lattice bounded by rectangles with nodal dimensions n and 6, n >= 2.

31, 0, 0, 165, 27, 32, 8, 0, 0, 720, 187, 236, 104, 30, 108, 3431, 992, 1179, 746, 251, 580, 920, 352, 1210, 16608, 4361, 5027, 4361, 1094, 2043, 5027, 2043, 6268, 76933, 17601, 20009, 21068, 3675, 7213, 26181, 9258, 26414, 25090, 10048, 32132

Offset: 2

Christopher Hunt Gribble, Jul 13 2012

The subset of nodes is contained in the top left-hand quarter of the rectangle and has nodal dimensions floor((n+1)/2) and 3 to capture all geometrically distinct counts.
The quarter-rectangle is read by rows.
The irregular array of numbers is:
...k.....1.....2.....3.....4.....5.....6.....7.....8.....9....10....11....12
.n
.2......31.....0.....0
.3.....165....27....32.....8.....0.....0
.4.....720...187...236...104....30...108
.5....3431...992..1179...746...251...580...920...352..1210
.6...16608..4361..5027..4361..1094..2043..5027..2043..6268
.7...76933.17601.20009.21068..3675..7213.26181..9258.26414.25090.10048.32132
where k indicates the position of the end node in the quarter-rectangle.
For each n, the maximum value of k is 3*floor((n+1)/2).
Reading this array by rows gives the sequence.

			When n = 2, the number of times (NT) each node in the rectangle is the end node (EN) of a complete non-self-adjacent simple path is
EN  0  1  2  3  4  5
    6  7  8  9 10 11
NT 31  0  0  0  0 31
   31  0  0  0  0 31
To limit duplication, only the top left-hand corner 31 and the two zeros to its right are stored in the sequence, i.e. T(2,1) = 31, T(2,2) = 0 and T(2,3) = 0.

Cf. A213106, A213249, A213379, A214025, A214119, A214121, A214122, A214359.

Comment corrected by Christopher Hunt Gribble, Jul 22 2012

A213383 Irregular array T(n,k) of numbers/2 of non-extendable (complete) non-self-adjacent simple paths of each length within a square lattice bounded by rectangles with nodal dimensions n and 7, n >= 2.

Original entry on oeis.org

4, 4, 6, 10, 14, 20, 26, 18, 2, 4, 8, 16, 22, 50, 66, 132, 160, 218, 120, 122, 56, 36, 4, 4, 8, 20, 40, 80, 122, 244, 336, 628, 628, 1130, 788, 1362, 878, 1168, 354, 292, 16

Offset: 2

Christopher Hunt Gribble, Jun 10 2012

The irregular array of numbers is:
...k..3....4....5....6....7....8....9...10...11...12...13...14...15...16...17...18...19...20
.n
.2....4....4....6...10...14...20...26...18....2
.3....4....8...16...22...50...66..132..160..218..120..122...56...36....4
.4....4....8...20...40...80..122..244..336..628..628.1130..788.1362..878.1168..354..292...16
where k is the path length in nodes. There is insufficient evidence to attempt to define the irregularity of the array.  However, the maximum values of k for 2 <= n <= 11 are 11, 16, 20, 24, 29, 33, 38, 42, 46, 50. Reading this array by rows gives the sequence. One half of the numbers of paths constitute the sequence to remove the effect of the bilateral symmetry of the rectangle.

			T(2,3) = One half of the number of complete non-self-adjacent simple paths of length 3 nodes within a square lattice bounded by a 2 X 7 node rectangle.

Cf. A213106, A213249, A213274, A213089, A213342, A213375, A213379.

A213425 Irregular array T(n,k) of numbers/2 of non-extendable (complete) non-self-adjacent simple paths of each length within a square lattice bounded by rectangles with nodal dimensions n and 8, n >= 2.

Original entry on oeis.org

4, 4, 6, 10, 14, 20, 30, 40, 34, 10, 4, 8, 16, 22, 52, 68, 144, 222, 334, 406, 302, 288, 198, 88, 52, 6, 4, 8, 20, 40, 82, 124, 258, 400, 894, 1098, 1984, 1960, 2796, 2388, 3426, 2290, 2638, 1008, 1316, 152

Offset: 2

Christopher Hunt Gribble, Jun 11 2012

The irregular array of numbers is:
...k..3....4....5....6....7....8....9...10...11...12...13...14...15...16...17...18...19...20...21...22
.n
.2....4....4....6...10...14...20...30...40...34...10
.3....4....8...16...22...52...68..144..222..334..406..302..288..198...88...52....6
.4....4....8...20...40...82..124..258..400..894.1098.1984.1960.2796.2388.3426.2290.2638.1008.1316..152
where k is the path length in nodes. There is insufficient evidence to attempt to define the irregularity of the array. However, the maximum values of k for 2 <= n <= 10 are 12, 18, 22, 27, 32, 38, 42, 48, 52. Reading this array by rows gives the sequence. One half of the numbers of paths constitute the sequence to remove the effect of the bilateral symmetry of the rectangle.

			T(2,3) = One half of the number of complete non-self-adjacent simple paths of length 3 nodes within a square lattice bounded by a 2 X 8 node rectangle.

Cf. A213106, A213249, A213274, A213089, A213342, A213375, A213379, A213383.

A213433 Irregular array T(n,k) of the numbers of distinct shapes under rotation of the non-extendable (complete) non-self-adjacent simple paths of each length within a square lattice bounded by rectangles with nodal dimensions n and 3, n >= 2.

Original entry on oeis.org

2, 4, 2, 2, 4, 6, 0, 4, 2, 4, 10, 18, 8, 8, 14, 2, 4, 10, 22, 34, 22, 36, 22, 18, 2, 4, 10, 22, 38, 56, 68, 80, 58, 34, 24, 2, 2, 4, 10, 22, 38, 60, 110, 138, 188, 106, 108, 54, 36, 4, 2, 4, 10, 22, 38, 60, 114, 188, 280, 360, 248, 254, 174, 84, 52, 6, 2, 4, 10, 22, 38, 60, 114, 192, 338, 494, 694, 534, 642, 402, 282, 130, 72, 8

Offset: 2

Christopher Hunt Gribble, Jun 11 2012

The irregular array of numbers is:
...k..3...4...5...6...7...8...9..10..11..12..13..14..15..16..17..18..19..20
.n
.2....2...4...2
.3....2...4...6...0...4
.4....2...4..10..18...8...8..14
.5....2...4..10..22..34..22..36..22..18
.6....2...4..10..22..38..56..68..80..58..34..24...2
.7....2...4..10..22..38..60.110.138.188.106.108..54..36...4
.8....2...4..10..22..38..60.114.188.280.360.248.254.174..84..52...6
.9....2...4..10..22..38..60.114.192.338.494.694.534.642.402.282.130..72...8
where k is the path length in nodes. In an attempt to define the irregularity of the array, it appears that the maximum value of k is 2n+1 for 2 <= n <= 6 and 2n+2 for n >= 7. Reading this array by rows gives the sequence.
The asymptotic sequence for the number of distinct shapes under rotation of the complete non-self-adjacent simple paths of each nodal length k, where n >= k-1, is 2, 4, 10, 22, 38, 60, 114, 192, 342, 564, 956, 1584, 2686, 4524, 7684, 12968 for which there appears to be no obvious formula.

			T(2,3) = The number of distinct shapes under rotation of the complete non-self-adjacent simple paths of length 3 nodes within a square lattice bounded by a 2 X 3 node rectangle.

Cf. A213106, A213249, A213431.

Added new comment.

A214037 Irregular array T(n,k) of the numbers of non-extendable (complete) non-self-adjacent simple paths starting at each of a minimal subset of nodes within a square lattice bounded by rectangles with nodal dimensions n and 7, n >= 2.

Original entry on oeis.org

21, 15, 11, 10, 164, 106, 72, 64, 142, 72, 38, 28, 888, 695, 607, 602, 780, 385, 258, 270, 5600, 4795, 4453, 4412, 4829, 2792, 2285, 2556, 4650, 2036, 1712, 2248, 35971, 30709, 27591, 26574, 30070, 18037, 14507, 15318, 27638, 13744, 13851, 17846

Offset: 2

Christopher Hunt Gribble, Jul 01 2012

The subset of nodes is contained in the top left-hand quarter of the rectangle and has nodal dimensions floor((n+1)/2) and 4 to capture all geometrically distinct counts.
The quarter-rectangle is read by rows.
The irregular array of numbers is:
...k......1.....2.....3.....4.....5.....6.....7.....8.....9....10....11....12
.n
.2.......21....15....11....10
.3......164...106....72....64....142...72....38....28
.4......888...695...607...602...780...385...258...270
.5.....5600..4795..4453..4412..4829..2792..2285..2556..4650..2036..1712..2248
.6....35971.30709.27591.26574.30070.18037.14507.15318.27638.13744.13851.17846
where k indicates the position of the start node in the quarter-rectangle.
For each n, the maximum value of k is 4*floor((n+1)/2).
Reading this array by rows gives the sequence.

			When n = 2, the number of times (NT) each node in the rectangle is the start node (SN) of a complete non-self-adjacent simple path is
SN  0  1  2  3  4  5  6
    7  8  9 10 11 12 13
NT 21 15 11 10 11 15 21
   21 15 11 10 11 15 21
To limit duplication, only the top left-hand corner 21 and the 15, 11 and 10 to its right are stored in the sequence, i.e. T(2,1) = 21, T(2,2) = 15, T(2,3) = 11 and T(2,4) = 10.

Cf. A213106, A213249, A213379, A213478, A213954, A214022, A214023, A214025

A214563 Irregular array T(n,k) of the numbers of non-extendable (complete) non-self-adjacent simple paths incorporating each of a minimal subset of nodes within a square lattice bounded by rectangles with nodal dimensions n and 5, n >= 2.

Original entry on oeis.org

40, 42, 40, 188, 209, 204, 210, 228, 204, 820, 1007, 1058, 1008, 907, 776, 3426, 4601, 5076, 4601, 4104, 3608, 5076, 3608, 2608, 13344, 18726, 21050, 18302, 17364, 15896, 21307, 15275, 11148, 50036, 71736, 81276, 69029, 67670, 63148, 80263, 61229, 46550, 82942, 60116, 44196

Offset: 2

Christopher Hunt Gribble, Jul 21 2012

The subset of nodes is contained in the top left-hand quarter of the rectangle and has nodal dimensions floor((n+1)/2) and 3 to capture all geometrically distinct counts.
The quarter-rectangle is read by rows.
The irregular array of numbers is:
...k.....1.....2.....3.....4.....5.....6.....7.....8.....9....10....11....12
.n
.2......40....42....40
.3.....188...209...204...210...228...204
.4.....820..1007..1058..1008...907...776
.5....3426..4601..5076..4601..4104..3608..5076..3608..2608
.6...13344.18726.21050.18302.17364.15896.21307.15275.11148
.7...50036.71736.81276.69029.67670.63148.80263.61229.46550.82942.60116.44196
where k indicates the position of a node in the quarter-rectangle.
For each n, the maximum value of k is 3*floor((n+1)/2).
Reading this array by rows gives the sequence.

			When n = 2, the number of times (NT) each node in the rectangle (N) occurs in a complete non-self-adjacent simple path is
N   0  1  2  3  4
    5  6  7  8  9
NT 40 42 40 42 40
   40 42 40 42 40
To limit duplication, only the top left-hand corner 40 and the 42 and 40 to its right are stored in the sequence,
i.e. T(2,1) = 40, T(2,2) = 42 and T(2,3) = 40.

Cf. A213106, A213249, A213375, A214023, A214359, A214397, A214399, A214504, A214510

Comment corrected by Christopher Hunt Gribble, Jul 22 2012

A213426 Irregular array T(n,k) of numbers/2 of non-extendable (complete) non-self-adjacent simple paths of each length within a square lattice bounded by rectangles with nodal dimensions n and 9, n >= 2.

Original entry on oeis.org

4, 4, 6, 10, 14, 20, 30, 44, 60, 60, 28, 2, 4, 8, 16, 22, 54, 70, 152, 238, 416, 574, 810, 642, 760, 456, 320, 136, 72, 8, 4, 8, 20, 40, 84, 126, 268, 418, 1014, 1450, 2890, 3510, 5474, 5286, 7238, 6926, 8218, 5636, 6754, 2956, 4220, 778, 48

Offset: 2

Christopher Hunt Gribble, Jun 11 2012

The irregular array of numbers is:
...k..3....4....5....6....7....8....9...10...11...12...13...14...15...16...17...18...19...20...21...22...23...24...25
.n
.2....4....4....6...10...14...20...30...44...60...60...28....2
.3....4....8...16...22...54...70..152..238..416..574..810..642..760..456..320..136...72....8
.4....4....8...20...40...84..126..268..418.1014.1450.2890.3510.5474.5286.7238.6926.8218.5636.6754.2956.4220..778...48
where k is the path length in nodes. There is insufficient evidence to attempt to define the irregularity of the array. However, the maximum values of k for 2 <= n <= 10 are 14, 20, 25, 30, 36, 42, 48, 53. Reading this array by rows gives the sequence. One half of the numbers of paths constitute the sequence to remove the effect of the bilateral symmetry of the rectangle.

			T(2,3) = One half of the number of complete non-self-adjacent simple paths of length 3 nodes within a square lattice bounded by a 2 X 9 node rectangle.

Cf. A213106, A213249, A213274, A213089, A213342, A213375, A213379, A213383, A213425.

A213473 Irregular array T(n,k) of the numbers of distinct shapes under rotation of the non-extendable (complete) non-self-adjacent simple paths of each length within a square lattice bounded by rectangles with nodal dimensions n and 4, n >= 2.

Original entry on oeis.org

2, 4, 6, 6, 2, 4, 10, 18, 8, 8, 14, 2, 4, 10, 18, 20, 12, 18, 8, 42, 2, 4, 10, 22, 46, 66, 60, 56, 106, 72, 236, 26, 2, 4, 10, 22, 50, 100, 152, 158, 230, 246, 410, 260, 546, 124, 32, 2, 4, 10, 22, 50, 104, 194, 300, 444, 542, 840, 650, 1056, 808, 1144, 354, 292, 16

Offset: 2

Christopher Hunt Gribble, Jun 12 2012

The irregular array of numbers is:
...k..3....4....5....6....7....8....9...10...11...12...13...14...15...16...17...18...19...20
.n
.2....2....4....6....6
.3....2....4...10...18....8....8...14
.4....2....4...10...18...20...12...18....8...42
.5....2....4...10...22...46...66...60...56..106...72..236...26
.6....2....4...10...22...50..100..152..158..230..246..410..260..546..124...32
.7....2....4...10...22...50..104..194..300..444..542..840..650.1056..808.1144..354..292...16
where k is the path length in nodes. There is insufficient evidence to attempt to define the irregularity of the array. However, the maximum values of k for 2 <= n <= 12 are 6, 9, 11, 14, 17, 20, 22, 25, 28, 30, 33. Reading this array by rows gives the sequence. The asymptotic sequence for the number of distinct shapes under rotation of the complete non-self-adjacent simple paths of each nodal length k, where n >= k-1, is 2, 4, 10, 22, 50, 104, 198, 354, 710, 1288, 2600 for which there appears to be no obvious formula.

			T(2,3) = The number of distinct shapes under rotation of the complete non-self-adjacent simple paths of length 3 nodes within a square lattice bounded by a 2 X 4 node rectangle.

Cf. A213106, A213249, A213431, A213433.

A214038 Irregular array T(n,k) of the numbers of non-extendable (complete) non-self-adjacent simple paths starting at each of a minimal subset of nodes within a square lattice bounded by rectangles with nodal dimensions n and 8, n >= 2.

Original entry on oeis.org

34, 23, 16, 13, 347, 225, 142, 109, 298, 146, 74, 46, 2347, 1842, 1526, 1387, 2008, 1001, 663, 669, 19287, 16735, 15113, 13878, 6131, 9444, 7697, 8612, 15246, 6758, 5858, 8496, 163666, 141849, 126129, 112049, 132636, 81112, 65551, 67006, 118724, 58677, 60918, 87046

Offset: 2

Christopher Hunt Gribble, Jul 01 2012

The subset of nodes is contained in the top left-hand quarter of the rectangle and has nodal dimensions floor((n+1)/2) and 4 to capture all geometrically distinct counts.
The quarter-rectangle is read by rows.
The irregular array of numbers is:
...k......1......2......3......4......5......6......7......8......9.....10.....11.....12
.n
.2.......34.....23.....16.....13
.3......347....225....142....109....298....146.....74.....46
.4.....2347...1842...1526...1387...2008...1001....663....669
.5....19287..16735..15113..13878...6131...9444...7697...8612..15246...6758...5858...8496
.6...163666.141849.126129.112049.132636..81112..65551..67006.118724..58677..60918..87046
where k indicates the position of the start node in the quarter-rectangle.
For each n, the maximum value of k is 4*floor((n+1)/2).
Reading this array by rows gives the sequence.

			When n = 2, the number of times (NT) each node in the rectangle is the start node (SN) of a complete non-self-adjacent simple path is
SN  0  1  2  3  4  5  6  7
    8  9 10 11 12 13 14 15
NT 34 23 16 13 13 16 23 34
   34 23 16 13 13 16 23 34
To limit duplication, only the top left-hand corner 34 and the 23, 16 and 13 to its right are stored in the sequence, i.e. T(2,1) = 34, T(2,2) = 23, T(2,3) = 16 and T(2,4) = 13.

Cf. A213106, A213249, A213425, A213478, A213954, A214022, A214023, A214025, A214037

A214373 Irregular array T(n,k) of the numbers of non-extendable (complete) non-self-adjacent simple paths ending at each of a minimal subset of nodes within a square lattice bounded by rectangles with nodal dimensions n and 7, n >= 2.

Original entry on oeis.org

52, 0, 0, 0, 353, 57, 62, 60, 10, 0, 0, 0, 1931, 495, 622, 602, 200, 56, 262, 364, 12027, 3522, 4399, 4170, 2143, 640, 1941, 2394, 2612, 954, 3956, 5136, 76933, 21068, 26181, 25090, 17601, 3675, 9258, 10048, 20009, 7213, 26414, 32132

Offset: 2

Christopher Hunt Gribble, Jul 14 2012

The subset of nodes is contained in the top left-hand quarter of the rectangle and has nodal dimensions floor((n+1)/2) and 4 to capture all geometrically distinct counts.
The quarter-rectangle is read by rows.
The irregular array of numbers is:
...k.....1.....2.....3.....4.....5.....6.....7.....8.....9....10....11....12
.n
.2......52.....0.....0.....0
.3.....353....57....62....60....10.....0.....0.....0
.4....1931...495...622...602...200....56...262...364
.5...12027..3522..4399..4170..2143...640..1941..2394..2612...954..3956..5136
.6...76933.21068.26181.25090.17601..3675..9258.10048.20009..7213.26414.32132
where k indicates the position of the end node in the quarter-rectangle.
For each n, the maximum value of k is 4*floor((n+1)/2).
Reading this array by rows gives the sequence.

			When n = 2, the number of times (NT) each node in the rectangle is the end node (EN) of a complete non-self-adjacent simple path is
EN  0  1  2  3  4  5  6
    7  8  9 10 11 12 13
NT 52  0  0  0  0  0 52
   52  0  0  0  0  0 52
To limit duplication, only the top left-hand corner 52 and the three zeros to its right are stored in the sequence, i.e. T(2,1) = 31, T(2,2) = 0, T(2,3) = 0 and T(2,4) = 0.

Cf. A213106, A213249, A213383, A214037, A214119, A214121, A214122, A214359, A213070.

Comment corrected by Christopher Hunt Gribble, Jul 22 2012

cp's OEIS Frontend

A213070 Irregular array T(n,k) of the numbers of non-extendable (complete) non-self-adjacent simple paths ending at each of a minimal subset of nodes within a square lattice bounded by rectangles with nodal dimensions n and 6, n >= 2.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Extensions

A213383 Irregular array T(n,k) of numbers/2 of non-extendable (complete) non-self-adjacent simple paths of each length within a square lattice bounded by rectangles with nodal dimensions n and 7, n >= 2.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

A213425 Irregular array T(n,k) of numbers/2 of non-extendable (complete) non-self-adjacent simple paths of each length within a square lattice bounded by rectangles with nodal dimensions n and 8, n >= 2.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

A213433 Irregular array T(n,k) of the numbers of distinct shapes under rotation of the non-extendable (complete) non-self-adjacent simple paths of each length within a square lattice bounded by rectangles with nodal dimensions n and 3, n >= 2.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Extensions

A214037 Irregular array T(n,k) of the numbers of non-extendable (complete) non-self-adjacent simple paths starting at each of a minimal subset of nodes within a square lattice bounded by rectangles with nodal dimensions n and 7, n >= 2.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

A214563 Irregular array T(n,k) of the numbers of non-extendable (complete) non-self-adjacent simple paths incorporating each of a minimal subset of nodes within a square lattice bounded by rectangles with nodal dimensions n and 5, n >= 2.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Extensions

A213426 Irregular array T(n,k) of numbers/2 of non-extendable (complete) non-self-adjacent simple paths of each length within a square lattice bounded by rectangles with nodal dimensions n and 9, n >= 2.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

A213473 Irregular array T(n,k) of the numbers of distinct shapes under rotation of the non-extendable (complete) non-self-adjacent simple paths of each length within a square lattice bounded by rectangles with nodal dimensions n and 4, n >= 2.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

A214038 Irregular array T(n,k) of the numbers of non-extendable (complete) non-self-adjacent simple paths starting at each of a minimal subset of nodes within a square lattice bounded by rectangles with nodal dimensions n and 8, n >= 2.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

A214373 Irregular array T(n,k) of the numbers of non-extendable (complete) non-self-adjacent simple paths ending at each of a minimal subset of nodes within a square lattice bounded by rectangles with nodal dimensions n and 7, n >= 2.

Views

Author

Keywords