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.

A082447 a(n) = the number k such that s(k)=0 where s(0)=n and s(i)=s(i-1)-(s(i-1) modulo (i+1)).

Table of values

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

List of values

[1, 2, 2, 3, 3, 4, 4, 4, 4, 5, 5, 6, 6, 6, 6, 6, 6, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8, 9, 9, 9, 9, 10, 10, 10, 10, 10, 10, 10, 10, 11, 11, 11, 11, 11, 11, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 13, 13, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 15, 15, 15]