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.

A073932 Define f(n) = n - largest nontrivial divisor of n or f(n) = n-1 if n is a prime [that is, f(n) = A060681(n)]. Form a triangle in which the n-th row contains terms n, f(n), f(f(n)), ... until a 1 is reached; sequence gives triangle read by rows.

Table of values

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

List of values

[1, 2, 1, 3, 2, 1, 4, 2, 1, 5, 4, 2, 1, 6, 3, 2, 1, 7, 6, 3, 2, 1, 8, 4, 2, 1, 9, 6, 3, 2, 1, 10, 5, 4, 2, 1, 11, 10, 5, 4, 2, 1, 12, 6, 3, 2, 1, 13, 12, 6, 3, 2, 1, 14, 7, 6, 3, 2, 1, 15, 10, 5, 4, 2, 1, 16, 8, 4, 2, 1, 17, 16, 8, 4, 2, 1, 18, 9, 6, 3, 2, 1, 19, 18, 9, 6, 3, 2, 1, 20, 10, 5, 4, 2, 1]