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.

A324369 Product of all primes p dividing n such that the sum of the base p digits of n is at least p, or 1 if no such prime.

Table of values

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

List of values

[1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 2, 1, 2, 3, 1, 1, 2, 1, 2, 3, 2, 1, 6, 1, 2, 1, 2, 1, 2, 1, 1, 3, 2, 1, 2, 1, 2, 3, 2, 1, 6, 1, 2, 15, 2, 1, 6, 1, 2, 3, 2, 1, 2, 1, 2, 3, 2, 1, 6, 1, 2, 3, 1, 5, 6, 1, 2, 3, 10, 1, 6, 1, 2, 3, 2, 1, 6, 1, 2, 1, 2, 1, 2, 5, 2, 3, 2, 1, 10, 7, 2, 3, 2, 5, 6, 1]