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.

A093411 Divide n by the largest factorial that divides it and repeat until an odd number is reached, which will be the result; a(0) = 0.

Table of values

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

List of values

[0, 1, 1, 3, 1, 5, 1, 7, 1, 9, 5, 11, 1, 13, 7, 15, 1, 17, 3, 19, 5, 21, 11, 23, 1, 25, 13, 27, 7, 29, 5, 31, 1, 33, 17, 35, 1, 37, 19, 39, 5, 41, 7, 43, 11, 45, 23, 47, 1, 49, 25, 51, 13, 53, 9, 55, 7, 57, 29, 59, 5, 61, 31, 63, 1, 65, 11, 67, 17, 69, 35, 71, 3, 73, 37, 75, 19, 77, 13, 79]