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.

A213900 The minimum number of 11's in the relation n*[n,11,11,...,11,n] = [x,...,x] between simple terminating continued fractions.

Table of values

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

List of values

[2, 3, 5, 4, 11, 7, 5, 11, 14, 1, 11, 6, 23, 19, 11, 8, 11, 17, 29, 7, 5, 23, 11, 24, 20, 35, 23, 13, 59, 5, 23, 3, 8, 39, 11, 18, 17, 27, 29, 3, 23, 43, 5, 59, 23, 15, 11, 55, 74, 35, 41, 26, 35, 9, 23, 35, 41, 57, 59, 2, 5, 23, 47, 34, 11, 67, 17, 23, 119, 13]

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

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