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.

A112374 Let T(n) = A000078(n+2), n >= 1; a(n) = smallest k such that n divides T(k).

Table of values

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

List of values

[1, 3, 6, 4, 6, 9, 8, 5, 9, 13, 20, 9, 10, 8, 6, 10, 53, 9, 48, 28, 18, 20, 35, 18, 76, 10, 9, 8, 7, 68, 20, 15, 20, 53, 30, 9, 58, 48, 78, 28, 19, 18, 63, 20, 68, 35, 28, 18, 46, 108, 76, 10, 158, 9, 52, 8, 87, 133, 18, 68, 51, 20, 46, 35, 78, 20, 17, 138, 35, 30, 230, 20, 72, 58, 76]

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

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