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

A214399 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 2, n >= 2.

Original entry on oeis.org

6, 12, 14, 23, 24, 40, 42, 40, 68, 70, 70, 113, 116, 116, 122, 186, 190, 192, 202, 304, 310, 314, 334, 334, 495, 504, 512, 546, 552, 804, 818, 832, 890, 902, 912, 1304, 1326, 1350, 1446, 1470, 1490, 2113, 2148, 2188, 2346, 2388, 2428, 2434, 3422, 3478, 3544, 3802, 3874, 3944, 3966
Offset: 2

Views

Author

Christopher Hunt Gribble, Jul 15 2012

Keywords

Comments

The subset of nodes is contained in the top left-hand quarter of the rectangle and has nodal dimensions floor((n+1)/2) and 1 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
..n
..2......6
..3.....12...14
..4.....23...24
..5.....40...42...40
..6.....68...70...70
..7....113..116..116..122
..8....186..190..192..202
..9....304..310..314..334..334
.10....495..504..512..546..552
.11....804..818..832..890..902..912
.12...1304.1326.1350.1446.1470.1490
.13...2113.2148.2188.2346.2388.2428.2434
.14...3422.3478.3544.3802.3874.3944.3966
.15...5540.5630.5738.6158.6278.6398.6442.6462
where k indicates the position of a node in the quarter-rectangle.
For each n, the maximum value of k is floor((n+1)/2).
Reading this array by rows gives the sequence.

Examples

			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
NT 6 6
   6 6
To limit duplication, only the top left-hand corner 6 is stored in the sequence, i.e. T(2,1) = 6.

Links

Crossrefs

Cf. A213106, A213249, A213274, A213478, A214119, A214397.

Extensions

Corrected by Christopher Hunt Gribble, Jul 19 2012

A214504 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 3, n >= 2.

Original entry on oeis.org

12, 14, 32, 36, 36, 48, 80, 88, 86, 100, 188, 210, 209, 228, 204, 204, 418, 470, 472, 524, 479, 452, 906, 1016, 1028, 1152, 1050, 1020, 1088, 980, 1943, 2170, 2219, 2472, 2250, 2222, 2333, 2200, 4137, 4610, 4754, 5260, 4811, 4738, 4929, 4784, 4920, 4924
Offset: 2

Views

Author

Christopher Hunt Gribble, Jul 19 2012

Keywords

Comments

The subset of nodes is contained in the top left-hand quarter of the rectangle and has nodal dimensions floor((n+1)/2) and 2 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
..n
..2.....12...14
..3.....32...36...36...48
..4.....80...88...86..100
..5....188..210..209..228..204..204
..6....418..470..472..524..479..452
..7....906.1016.1028.1152.1050.1020.1088..980
..8...1943.2170.2219.2472.2250.2222.2333.2200
..9...4137.4610.4754.5260.4811.4738.4929.4784.4920.4924
where k indicates the position of a node in the quarter-rectangle.
For each n, the maximum value of k is 2*floor((n+1)/2).
Reading this array by rows gives the sequence.

Examples

			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
NT 12 14 12
   12 14 12
To limit duplication, only the top left-hand corner 12 and the 14 to its right are stored in the sequence,
  i.e. T(2,1) = 12 and T(2,2) = 14.

Links

Crossrefs

Cf. A213106, A213249, A213089, A213954, A214121, A214397, A214399

Extensions

Comment corrected by Christopher Hunt Gribble, Jul 22 2012

A214510 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 4, n >= 2.

Original entry on oeis.org

23, 24, 80, 86, 88, 100, 264, 303, 303, 282, 820, 1008, 1007, 907, 1058, 776, 2401, 3043, 3013, 2844, 3312, 2375, 6751, 8651, 8562, 8317, 9411, 7116, 9718, 6882, 18630, 24035, 23979, 23261, 26077, 20216, 26479, 20016, 50775, 65977, 66474, 63790, 72137, 55400, 71469, 55907, 69764, 57274
Offset: 2

Views

Author

Christopher Hunt Gribble, Jul 19 2012

Keywords

Comments

The subset of nodes is contained in the top left-hand quarter of the rectangle and has nodal dimensions floor((n+1)/2) and 2 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
.n
.2......23....24
.3......80....86....88...100
.4.....264...303...303...282
.5.....820..1008..1007...907..1058...776
.6....2401..3043..3013..2844..3312..2375
.7....6751..8651..8562..8317..9411..7116..9718..6882
.8...18630.24035.23979.23261.26077.20216.26479.20016
.9...50775.65977.66474.63790.72137.55400.71469.55907.69764.57274
where k indicates the position of a node in the quarter-rectangle.
For each n, the maximum value of k is 2*floor((n+1)/2).
Reading this array by rows gives the sequence.

Examples

			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
NT 23 24 24 23
   23 24 24 23
To limit duplication, only the top left-hand corner 23 and the 24 to its right are stored in the sequence,
i.e. T(2,1) = 23 and T(2,2) = 24.

Links

Crossrefs

Cf. A213106, A213249, A213342, A214022, A214122, A214397, A214399, A214504

Extensions

Comment corrected by Christopher Hunt Gribble, Jul 22 2012

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

Views

Author

Christopher Hunt Gribble, Jul 21 2012

Keywords

Comments

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.

Examples

			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.

Links

Crossrefs

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

Extensions

Comment corrected by Christopher Hunt Gribble, Jul 22 2012

A214601 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 6, n >= 2.

Original entry on oeis.org

68, 70, 70, 418, 472, 479, 470, 524, 452, 2401, 3013, 3312, 3043, 2844, 2375, 13344, 18302, 21307, 18726, 17364, 15275, 21050, 15896, 11148, 68230, 98032, 117197, 98032, 95942, 89083, 117197, 89083, 64506, 335569, 494659, 599448, 482769, 488710, 463257, 577787, 465142, 353704, 600124, 458850, 341918
Offset: 2

Views

Author

Christopher Hunt Gribble, Jul 22 2012

Keywords

Comments

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.......68.....70.....70
.3......418....472....479....470....524....452
.4.....2401...3013...3312...3043...2844...2375
.5....13344..18302..21307..18726..17364..15275..21050..15896..11148
.6....68230..98032.117197..98032..95942..89083.117197..89083..64506
.7...335569.494659.599448.482769.488710.463257.577787.465142.353704.600124.458850.341918
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.

Examples

			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 10 11
NT 68 70 70 70 70 68
   68 70 70 70 70 68
To limit duplication, only the top left-hand corner 68 and the two 70's to its right are stored in the sequence,
i.e. T(2,1) = 68, T(2,2) = 70 and T(2,3) = 70.

Links

Crossrefs

Cf. A213106, A213249, A213379, A214025, A213070, A214397, A214399, A214504, A214510, A214563

A214503 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 7, n >= 2.

Original entry on oeis.org

113, 116, 116, 122, 906, 1028, 1050, 1088, 1016, 1152, 1020, 980, 6751, 8562, 9411, 9718, 8651, 8317, 7116, 6882, 50036, 69029, 80263, 82942, 71736, 67670, 61229, 60116, 81276, 63148, 46550, 44196, 335569, 482769, 577787, 600124, 494659, 488710, 465142, 458850, 599448, 463257, 353704, 341918
Offset: 2

Views

Author

Christopher Hunt Gribble, Jul 22 2012

Keywords

Comments

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......113....116....116....122
.3......906...1028...1050...1088...1016...1152...1020....980
.4.....6751...8562...9411...9718...8651...8317...7116...6882
.5....50036..69029..80263..82942..71736..67670..61229..60116..81276..63148..46550..44196
.6...335569.482769.577787.600124.494659.488710.465142.458850.599448.463257.353704.341918
where k indicates the position of a 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.

Examples

			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  10  11  12  13
NT 113 116 116 122 116 116 113
   113 116 116 122 116 116 113
To limit duplication, only the top left-hand corner 113 and the 116, 116, 122 to its right are stored in the sequence,
i.e. T(2,1) = 113, T(2,2) = 116, T(2,3) = 116 and T(2,4) = 122.

Links

Crossrefs

Cf. A213106, A213249, A213383, A214037, A214373, A214397, A214399, A214504, A214510, A214563, A214601

A214605 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 8, n >= 2.

Original entry on oeis.org

186, 190, 192, 202, 1943, 2219, 2250, 2333, 2170, 2472, 2222, 2200, 18630, 23979, 26077, 26479, 24035, 23261, 20216, 20016, 184991, 259387, 298358, 300853, 269833, 254971, 232802, 232923, 307936, 238766, 178292, 178350
Offset: 2

Views

Author

Christopher Hunt Gribble, Jul 22 2012

Keywords

Comments

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......186....190....192....202
.3.....1943...2219...2250...2333...2170...2472...2222...2200
.4....18630..23979..26077..26479..24035..23261..20216..20016
.5...184991.259387.298358.300853.269833.254971.232802.232923.307936.238766.178292.178350
where k indicates the position of a 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.

Examples

			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  10  11  12  13  14  15
NT 186 190 192 202 202 192 190 186
   186 190 192 202 202 192 190 186
To limit duplication, only the top left-hand corner 186 and the 190, 192, 202 to its right are stored in the sequence,
i.e. T(2,1) = 186, T(2,2) = 190, T(2,3) = 192 and T(2,4) = 202.

Links

Crossrefs

Cf. A213106, A213249, A213425, A214038, A214375, A214397, A214399, A214504, A214510, A214563, A214601, A214503

A214608 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 9, n >= 2.

Original entry on oeis.org

304, 310, 314, 334, 334, 4137, 4754, 4811, 4929, 4920, 4610, 5260, 4738, 4784, 4924, 50775, 66474, 72137, 71469, 69764, 65977, 63790, 55400, 55907, 57274, 676474, 969677, 1118226, 1096104, 1058044, 1003962, 946620, 864012, 870946, 884912, 1154902, 887242, 651592, 669896, 710904
Offset: 2

Views

Author

Christopher Hunt Gribble, Jul 22 2012

Keywords

Comments

The subset of nodes is contained in the top left-hand quarter of the rectangle and has nodal dimensions floor((n+1)/2) and 5 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......13......14......15
.n
.2......304.....310.....314.....334.....334
.3.....4137....4754....4811....4929....4920....4610....5260....4738....4784....4924
.4....50775...66474...72137...71469...69764...65977...63790...55400...55907...57274
.5...676474..969677.1118226.1096104.1058044.1003962..946620..864012..870946..884912.1154902..887242..651592..669896..710904
where k indicates the position of a node in the quarter-rectangle.
For each n, the maximum value of k is 5*floor((n+1)/2).
Reading this array by rows gives the sequence.

Examples

			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  10  11  12  13  14  15  16  17
NT 304 310 314 334 334 334 314 310 304
   304 310 314 334 334 334 314 310 304
To limit duplication, only the top left-hand corner 304 and the 310, 314, 334, 334 to its right are stored in the sequence,
i.e. T(2,1) = 304, T(2,2) = 310, T(2,3) = 314, T(2,4) = 334 and T(2,5) = 334.

Links

Crossrefs

Cf. A213106, A213249, A213426, A214042, A214376, A214397, A214399, A214504, A214510, A214563, A214601, A214503, A214605
Showing 1-8 of 8 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.