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.

A321769 Consider the 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 second component of P(n, k).

Table of values

n a(n)
1 4
2 12
3 20
4 8
5 24
6 48
7 28
8 80
9 120
10 36
11 56
12 72
13 12
14 40
15 88
16 60
17 208
18 304
19 84
20 168
21 224
22 44
23 176
24 336
25 180
26 456
27 696
28 220
29 288
30 360
31 52
32 140
33 252
34 120
35 252
36 396
37 136
38 132
39 156
40 16
41 60
42 140
43 104
44 396
45 572
46 152
47 340
48 460
49 96
50 468
51 884
52 464
53 1140
54 1748
55 560
56 700

List of values

[4, 12, 20, 8, 24, 48, 28, 80, 120, 36, 56, 72, 12, 40, 88, 60, 208, 304, 84, 168, 224, 44, 176, 336, 180, 456, 696, 220, 288, 360, 52, 140, 252, 120, 252, 396, 136, 132, 156, 16, 60, 140, 104, 396, 572, 152, 340, 460, 96, 468, 884, 464, 1140, 1748, 560, 700]