|
|
A335056
|
|
Triangle read by rows: consider a figure made up of a row of n congruent rectangles and the diagonals of all possible rectangles; T(n,k) (1 <= k <= n) is the number of vertices inside the k-th rectangle.
|
|
3
|
|
|
1, 3, 3, 5, 11, 5, 7, 19, 19, 7, 9, 29, 43, 29, 9, 11, 37, 61, 61, 37, 11, 13, 47, 83, 105, 83, 47, 13, 15, 57, 103, 143, 143, 103, 57, 15, 17, 69, 125, 183, 211, 183, 125, 69, 17, 19, 81, 143, 215, 267, 267, 215, 143, 81, 19, 21, 95, 167, 253, 329, 369, 329, 253, 167, 95, 21, 23, 109, 189, 289, 385, 455, 455, 385, 289, 189, 109, 23
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
The terms are from numeric computation - no formula for a(n) is currently known.
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
Triangle begins:
1;
3, 3;
5, 11, 5;
7, 19, 19, 7;
9, 29, 43, 29, 9;
11, 37, 61, 61, 37, 11;
13, 47, 83, 105, 83, 47, 13;
15, 57, 103, 143, 143, 103, 57, 15;
17, 69, 125, 183, 211, 183, 125, 69, 17;
19, 81, 143, 215, 267, 267, 215, 143, 81, 19;
21, 95, 167, 253, 329, 369, 329, 253, 167, 95, 21;
23, 109, 189, 289, 385, 455, 455, 385, 289, 189, 109, 23;
25, 125, 215, 331, 451, 551, 597, 551, 451, 331, 215, 125, 25;
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|