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

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.

Original entry on oeis.org

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

Views

Author

Christopher Hunt Gribble, Jul 13 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......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.

Examples

			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.

Links

Crossrefs

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

Extensions

Comment corrected by Christopher Hunt Gribble, Jul 22 2012

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

Views

Author

Christopher Hunt Gribble, Jul 01 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.......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.

Examples

			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.

Links

Crossrefs

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

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

Views

Author

Christopher Hunt Gribble, Jul 01 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.......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.

Examples

			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.

Links

Crossrefs

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

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

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

Original entry on oeis.org

55, 36, 24, 18, 16, 732, 476, 294, 197, 168, 628, 302, 148, 82, 64, 6115, 4840, 3979, 3349, 3076, 5170, 2597, 1718, 1595, 1564, 64904, 57210, 52820, 46787, 43294, 53478, 31544, 26459, 28472, 28700, 50228, 22432, 19802, 27924, 30696
Offset: 2

Views

Author

Christopher Hunt Gribble, Jul 01 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......55....36....24....18....16
.3.....732...476...294...197...168...628...302...148....82....64
.4....6115..4840..3979..3349..3076..5170..2597..1718..1595..1564
.5...64904.57210.52820.46787.43294.53478.31544.26459.28472.28700.50228.22432.19802.27924.30696
where k indicates the position of the start 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 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 16 17
NT 55 36 24 18 16 18 24 36 55
   55 36 24 18 16 18 24 36 55
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.

Links

Crossrefs

Cf. A213106, A213249, A213426, A213478, A213954, A214022, A214023, A214025, A214037, A214038

Extensions

Comment corrected by Christopher Hunt Gribble, Jul 22 2012
Showing 1-5 of 5 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.