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.

A321770 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 third component of P(n, k).

Table of values

n a(n)
1 5
2 13
3 29
4 17
5 25
6 73
7 53
8 89
9 169
10 85
11 65
12 97
13 37
14 41
15 137
16 109
17 233
18 425
19 205
20 193
21 305
22 125
23 185
24 505
25 349
26 505
27 985
28 509
29 337
30 481
31 173
32 149
33 373
34 241
35 277
36 565
37 305
38 157
39 205
40 65
41 61
42 221
43 185
44 445
45 797
46 377
47 389
48 629
49 265
50 493
51 1325
52 905
53 1261
54 2477

List of values

[5, 13, 29, 17, 25, 73, 53, 89, 169, 85, 65, 97, 37, 41, 137, 109, 233, 425, 205, 193, 305, 125, 185, 505, 349, 505, 985, 509, 337, 481, 173, 149, 373, 241, 277, 565, 305, 157, 205, 65, 61, 221, 185, 445, 797, 377, 389, 629, 265, 493, 1325, 905, 1261, 2477]