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.

A379883 a(1) = 1. Let j = a(n-1) and r = A046144(j). Then for n > 1, if j is novel and r > 0, a(n) = r. If j is novel and r = 0 then a(n) = 1. If j has occurred k (>1) times already then a(n) = k*j.

Table of values

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

List of values

[1, 1, 2, 1, 3, 1, 4, 1, 5, 2, 4, 8, 1, 6, 1, 7, 2, 6, 12, 1, 8, 16, 1, 9, 2, 8, 24, 1, 10, 2, 10, 20, 1, 11, 4, 12, 24, 48, 1, 12, 36, 1, 13, 4, 16, 32, 1, 14, 2, 12, 48, 96, 1, 15, 1, 16, 48, 144, 1, 17, 8, 32, 64, 1, 18, 2, 14, 28, 1, 19, 6, 18, 36, 72, 1, 20, 40, 1, 21, 1, 22, 4, 20, 60, 1, 23, 10, 30, 1, 24, 72, 144, 288, 1, 25, 8, 40, 80, 1, 26, 4]