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.

A067993 Consider the sequence of ratios min(t(n-1)/t(n), t(n)/t(n-1)), n=2,3,4,..., where the t(n) are the terms of A067992. Let m be the smallest integer such that all fractions 1/n, 2/n, ..., (n-1)/n have appeared when we reach A067992(m); this sequence gives the values of m; set a(n)=0 if some fraction i/n never appears.

Table of values

n a(n)
1 1
2 2
3 4
4 6
5 18
6 10
7 20
8 32
9 38
10 42
11 44
12 64
13 104
14 110
15 118
16 134
17 144
18 148
19 264
20 252
21 266
22 270
23 272
24 412
25 418
26 432
27 438
28 442
29 444
30 498
31 530
32 586
33 712
34 720
35 722
36 730
37 744
38 1014
39 1020
40 1024
41 1026
42 1042
43 1154
44 1158
45 1160
46 1172
47 1174
48 1178
49 1516
50 1482

List of values

[1, 2, 4, 6, 18, 10, 20, 32, 38, 42, 44, 64, 104, 110, 118, 134, 144, 148, 264, 252, 266, 270, 272, 412, 418, 432, 438, 442, 444, 498, 530, 586, 712, 720, 722, 730, 744, 1014, 1020, 1024, 1026, 1042, 1154, 1158, 1160, 1172, 1174, 1178, 1516, 1482]

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

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