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.

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

Table of values

n a(n)
1 1
2 2
3 1
4 4
5 4
6 2
7 7
8 10
9 9
10 2
11 12
12 21
13 27
14 15
15 3
16 20
17 40
18 65
19 57
20 25
21 3
22 33
23 72
24 138
25 163
26 114
27 37
28 4
29 54
30 125
31 270
32 394
33 378
34 206
35 54
36 4
37 88
38 212
39 500
40 854
41 1033
42 796
43 354
44 74
45 5
46 143
47 354
48 891
49 1716
50 2479
51 2463
52 1571
53 574
54 100
55 5
56 232
57 585
58 1545
59 3265
60 5424
61 6559
62 5469
63 2917
64 896
65 130
66 6

List of values

[1, 2, 1, 4, 4, 2, 7, 10, 9, 2, 12, 21, 27, 15, 3, 20, 40, 65, 57, 25, 3, 33, 72, 138, 163, 114, 37, 4, 54, 125, 270, 394, 378, 206, 54, 4, 88, 212, 500, 854, 1033, 796, 354, 74, 5, 143, 354, 891, 1716, 2479, 2463, 1571, 574, 100, 5, 232, 585, 1545, 3265, 5424, 6559, 5469, 2917, 896, 130, 6]