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.

A192330 Minimum number of endpoints of a tree so that there exists a zero-entropy map defined on it having a period n orbit.

Table of values

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

List of values

[1, 2, 3, 2, 5, 3, 7, 2, 6, 5, 11, 3, 13, 7, 10, 2, 17, 6, 19, 5, 14, 11, 23, 3, 20, 13, 15, 7, 29, 10, 31, 2, 22, 17, 28, 6, 37, 19, 26, 5, 41, 14, 43, 11, 25, 23, 47, 3, 42, 20, 34, 13, 53, 15, 44, 7, 38, 29, 59, 10, 61, 31, 35, 2, 52, 22, 67, 17, 46, 28, 71, 6, 73, 37]

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

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