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.

A353960 a(1)=1. Thereafter, if a(n) has occurred k (>1) times in a(j), 1 <= j <= n then a(n+1) = k*a(n). If a(n) is a first occurrence, a(n+1) = A078709(a(n)).

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

List of values

[1, 1, 2, 1, 3, 1, 4, 1, 5, 2, 4, 8, 2, 6, 1, 6, 12, 2, 8, 16, 3, 6, 18, 3, 9, 3, 12, 24, 3, 15, 3, 18, 36, 4, 12, 36, 72, 6, 24, 48, 4, 16, 32, 5, 10, 2, 10, 20, 3, 21, 5, 15, 30, 3, 24, 72, 144, 9, 18, 54, 6, 30, 60, 5, 20, 40, 5, 25, 8, 24, 96, 8, 32, 64, 9, 27, 6, 36, 108, 9]