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.

A101183 Number of times (>0) function f must be applied in A100800 to arrive at multiple of n, or 0 if multiple of n is never reached.

Table of values

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

List of values

[1, 1, 1, 1, 1, 1, 1, 1, 1, 14, 32, 3, 12, 36, 3, 31, 10, 2, 71, 8, 8, 8, 11, 8, 67, 8, 3, 35, 35, 10, 31, 53, 22, 45, 38, 4, 59, 70, 44, 27, 27, 19, 44, 36, 5, 14, 47, 42, 33, 66, 16, 33, 42, 11, 105, 151, 5, 92, 69, 7, 7, 48, 6, 23, 20, 22, 7, 62, 22, 145, 7, 7, 20, 7, 58, 7, 184, 44]