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.

A364611 For p = 5 and n > 0, write n = p^m + k, m >= 0, with maximal p^m <= n, with 0 <= k < p^(m+1) - p^m, then for n such that k=0, a(n)=n, and for n such that k > 0, a(n) is the smallest q*a(k), prime q != p, that is not already a term.

Table of values

n a(n)
1 1
2 2
3 4
4 8
5 5
6 3
7 6
8 12
9 16
10 10
11 9
12 18
13 24
14 32
15 20
16 27
17 36
18 48
19 64
20 40
21 54
22 72
23 96
24 128
25 25
26 7
27 14
28 28
29 56
30 15
31 21
32 42
33 84
34 112
35 30
36 63
37 126
38 168
39 224
40 60
41 81
42 108
43 144
44 192
45 80
46 162
47 216
48 288
49 256
50 50
51 49
52 98
53 196
54 392
55 45
56 147
57 294
58 252
59 336
60 90
61 189
62 378
63 504

List of values

[1, 2, 4, 8, 5, 3, 6, 12, 16, 10, 9, 18, 24, 32, 20, 27, 36, 48, 64, 40, 54, 72, 96, 128, 25, 7, 14, 28, 56, 15, 21, 42, 84, 112, 30, 63, 126, 168, 224, 60, 81, 108, 144, 192, 80, 162, 216, 288, 256, 50, 49, 98, 196, 392, 45, 147, 294, 252, 336, 90, 189, 378, 504]