This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A215107 Triangle read by rows: T(n,k) is the nodal length of the longest non-extendable (complete) non-self-adjacent simple path within a square lattice bounded by rectangles with nodal dimensions n and k, n >= k >= 2. 0
 3, 5, 7, 6, 9, 11, 8, 11, 14, 17, 9, 14, 17, 21, 24, 11, 16, 20, 24, 29, 33, 12, 18, 22, 27, 32, 38, 42, 14, 20, 25, 30, 36, 42, 48, 53 (list; table; graph; refs; listen; history; text; internal format)
 OFFSET 2,1 COMMENTS The triangle T(n,k) is: ....k..2..3..4..5..6..7..8..9 .n .2.....3 .3.....5..7 .4.....6..9.11 .5.....8.11.14.17 .6.....9.14.17.21.24 .7....11.16.20.24.29.33 .8....12.18.22.27.32.38.42 .9....14.20.25.30.36.42.48.53 Reading this triangle by rows gives the sequence. It appears that T(n,k) <= ceil(3nk/4). LINKS EXAMPLE T(2,2) = nodal length of the longest complete non-self-adjacent simple path within a 2 X 2 node rectangle. CROSSREFS Cf. A213106, A213249 Sequence in context: A071581 A184722 A219781 * A084393 A100005 A215457 Adjacent sequences:  A215104 A215105 A215106 * A215108 A215109 A215110 KEYWORD nonn,tabl AUTHOR Christopher Hunt Gribble, Aug 03 2012 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified April 20 06:36 EDT 2019. Contains 322294 sequences. (Running on oeis4.)