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.

A321768 Consider the ternary tree of triples P(n, k) with n > 0 and 0 < k <= 3^(n-1), such that P(1, 1) = [3; 4; 5] and each triple t on some row branches to the triples A*t, B*t, C*t on the next row (with A = [1, -2, 2; 2, -1, 2; 2, -2, 3], B = [1, 2, 2; 2, 1, 2; 2, 2, 3] and C = [-1, 2, 2; -2, 1, 2; -2, 2, 3]); T(n, k) is the first component of P(n, k).

Table of values

n a(n)
1 3
2 5
3 21
4 15
5 7
6 55
7 45
8 39
9 119
10 77
11 33
12 65
13 35
14 9
15 105
16 91
17 105
18 297
19 187
20 95
21 207
22 117
23 57
24 377
25 299
26 217
27 697
28 459
29 175
30 319
31 165
32 51
33 275
34 209
35 115
36 403
37 273
38 85
39 133
40 63
41 11
42 171
43 153
44 203
45 555
46 345
47 189
48 429
49 247
50 155
51 987
52 777
53 539
54 1755
55 1161
56 429

List of values

[3, 5, 21, 15, 7, 55, 45, 39, 119, 77, 33, 65, 35, 9, 105, 91, 105, 297, 187, 95, 207, 117, 57, 377, 299, 217, 697, 459, 175, 319, 165, 51, 275, 209, 115, 403, 273, 85, 133, 63, 11, 171, 153, 203, 555, 345, 189, 429, 247, 155, 987, 777, 539, 1755, 1161, 429]