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.

A192018 Triangle read by rows: T(n,k) is the number of unordered pairs of nodes at distance k in the binary Fibonacci tree of order n (1<=k<=2n-3; entries in row n are the coefficients of the corresponding Wiener polynomial).

Table of values

n a(n)
2 1
3 3
4 2
5 1
6 6
7 6
8 5
9 3
10 1
11 11
12 13
13 14
14 12
15 10
16 5
17 1
18 19
19 24
20 30
21 31
22 31
23 28
24 19
25 7
26 1
27 32
28 42
29 56
30 66
31 74
32 78
33 77
34 61
35 32
36 9
37 1
38 53
39 71
40 98
41 124
42 152
43 175
44 196
45 203
46 180
47 118
48 49
49 11
50 1
51 87
52 118
53 166
54 218
55 284
56 349
57 419
58 485
59 525
60 502
61 384
62 207
63 70
64 13
65 1
66 142
67 194
68 276
69 370
70 499
71 645
72 812
73 998
74 1189
75 1331
76 1349
77 1152
78 749
79 336
80 95
81 15
82 1

List of values

[1, 3, 2, 1, 6, 6, 5, 3, 1, 11, 13, 14, 12, 10, 5, 1, 19, 24, 30, 31, 31, 28, 19, 7, 1, 32, 42, 56, 66, 74, 78, 77, 61, 32, 9, 1, 53, 71, 98, 124, 152, 175, 196, 203, 180, 118, 49, 11, 1, 87, 118, 166, 218, 284, 349, 419, 485, 525, 502, 384, 207, 70, 13, 1, 142, 194, 276, 370, 499, 645, 812, 998, 1189, 1331, 1349, 1152, 749, 336, 95, 15, 1]