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.

A364628 For p = 7 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 16
6 32
7 7
8 3
9 6
10 12
11 24
12 48
13 64
14 14
15 9
16 18
17 36
18 72
19 96
20 128
21 28
22 27
23 54
24 108
25 144
26 192
27 256
28 56
29 81
30 162
31 216
32 288
33 384
34 512
35 112
36 243
37 324
38 432
39 576
40 768
41 1024
42 224
43 486
44 648
45 864
46 1152
47 1536
48 2048
49 49
50 5
51 10
52 20
53 40
54 80
55 160
56 21
57 15
58 30
59 60
60 120

List of values

[1, 2, 4, 8, 16, 32, 7, 3, 6, 12, 24, 48, 64, 14, 9, 18, 36, 72, 96, 128, 28, 27, 54, 108, 144, 192, 256, 56, 81, 162, 216, 288, 384, 512, 112, 243, 324, 432, 576, 768, 1024, 224, 486, 648, 864, 1152, 1536, 2048, 49, 5, 10, 20, 40, 80, 160, 21, 15, 30, 60, 120]