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.

A326889 a(1) = 1; thereafter a(n) = a(n-1) / phi(n) if phi(n) divides a(n-1), otherwise a(n) = a(n-1) * phi(n), where phi is the Euler phi-function A000010.

Table of values

n a(n)
1 1
2 1
3 2
4 1
5 4
6 2
7 12
8 3
9 18
10 72
11 720
12 180
13 15
14 90
15 720
16 90
17 1440
18 240
19 4320
20 540
21 45
22 450
23 9900
24 79200
25 3960
26 330
27 5940
28 495
29 13860
30 110880
31 3696
32 231
33 4620
34 73920
35 3080
36 36960
37 1330560
38 73920
39 3080
40 49280
41 1232
42 14784
43 352
44 7040
45 168960
46 7680
47 353280
48 22080

List of values

[1, 1, 2, 1, 4, 2, 12, 3, 18, 72, 720, 180, 15, 90, 720, 90, 1440, 240, 4320, 540, 45, 450, 9900, 79200, 3960, 330, 5940, 495, 13860, 110880, 3696, 231, 4620, 73920, 3080, 36960, 1330560, 73920, 3080, 49280, 1232, 14784, 352, 7040, 168960, 7680, 353280, 22080]