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.

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.

Table of values

n a(n)
2 3
3 5
4 7
5 6
6 9
7 11
8 8
9 11
10 14
11 17
12 9
13 14
14 17
15 21
16 24
17 11
18 16
19 20
20 24
21 29
22 33
23 12
24 18
25 22
26 27
27 32
28 38
29 42
30 14
31 20
32 25
33 30
34 36
35 42
36 48
37 53

List of values

[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]

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

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