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.

A359064 a(n) is the number of trees of order n such that the number of eigenvalues of the Laplacian matrix in the interval [0, 1) is equal to ceiling((d + 1)/3) = A008620(d), where d is the diameter of the tree.

Table of values

n a(n)
5 2
6 5
7 7
8 12
9 20
10 33
11 52
12 86
13 137
14 222
15 353
16 568
17 900
18 1433
19 2260
20 3574

List of values

[2, 5, 7, 12, 20, 33, 52, 86, 137, 222, 353, 568, 900, 1433, 2260, 3574]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.