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.

A202318 Let (n)_p denote the exponent of prime p in the prime power factorization of n. Then a(n) is defined by the formulas a(1)=1; for n >= 2, (a(n))_2 = (n)_2, (a(n))_3 = (n)_3 and, for p >= 5, (a(n))_p = 1 + ((2n)/(p-1))_p if p-1|2*n, and (a(n))_p = 0 otherwise.

Table of values

n a(n)
1 1
2 10
3 21
4 20
5 11
6 2730
7 1
8 680
9 1197
10 550
11 23
12 5460
13 1
14 290
15 7161
16 1360
17 1
18 5757570
19 1
20 45100
21 6321
22 230
23 47
24 185640
25 11
26 530
27 3591
28 580
29 59
30 283933650
31 1
32 2720
33 32361
34 10
35 781
36 840605220
37 1
38 10
39 1659
40 1533400
41 83
42 23830170
43 1
44 40940
45 408177
46 470
47 1
48 36014160
49 1
50 277750
51 2163
52 1060
53 107
54 1882725390

List of values

[1, 10, 21, 20, 11, 2730, 1, 680, 1197, 550, 23, 5460, 1, 290, 7161, 1360, 1, 5757570, 1, 45100, 6321, 230, 47, 185640, 11, 530, 3591, 580, 59, 283933650, 1, 2720, 32361, 10, 781, 840605220, 1, 10, 1659, 1533400, 83, 23830170, 1, 40940, 408177, 470, 1, 36014160, 1, 277750, 2163, 1060, 107, 1882725390]