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.

A316502 Matula-Goebel numbers of unlabeled rooted trees with n nodes in which the branches of any node with more than one branch have empty intersection.

Table of values

n a(n)
1 1
2 2
3 3
4 4
5 5
6 6
7 7
8 8
9 10
10 11
11 12
12 13
13 14
14 15
15 16
16 17
17 18
18 19
19 20
20 22
21 24
22 26
23 28
24 29
25 30
26 31
27 32
28 33
29 34
30 35
31 36
32 37
33 38
34 40
35 41
36 42
37 43
38 44
39 45
40 47
41 48
42 50
43 51
44 52
45 53
46 54
47 55
48 56
49 58
50 59
51 60
52 61
53 62
54 64
55 66
56 67
57 68
58 70
59 71
60 72
61 74
62 75
63 76
64 77
65 78
66 79
67 80

List of values

[1, 2, 3, 4, 5, 6, 7, 8, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 22, 24, 26, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 40, 41, 42, 43, 44, 45, 47, 48, 50, 51, 52, 53, 54, 55, 56, 58, 59, 60, 61, 62, 64, 66, 67, 68, 70, 71, 72, 74, 75, 76, 77, 78, 79, 80]

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

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