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.

A356867 For n >= 1, write n = 3^m + k, where m >= 0 is the greatest power of 3 <= n, and k is in the range 0 <= k < 3^(m+1) - 3^m, then for n such that k=0, a(n)=n, and for n such that k > 0, a(n) is the smallest prime multiple p*a(k), p != 3, that is not already a term.

Table of values

n a(n)
1 1
2 2
3 3
4 5
5 4
6 6
7 10
8 8
9 9
10 7
11 14
12 15
13 25
14 20
15 12
16 50
17 16
18 18
19 35
20 28
21 30
22 125
23 40
24 24
25 100
26 32
27 27
28 11
29 22
30 21
31 55
32 44
33 42
34 70
35 56
36 45
37 49
38 98
39 75
40 175
41 140
42 60
43 250
44 80
45 36
46 245
47 196
48 150
49 625
50 200
51 48
52 500
53 64
54 54
55 77
56 110
57 105
58 275
59 88
60 84
61 350
62 112
63 90
64 343

List of values

[1, 2, 3, 5, 4, 6, 10, 8, 9, 7, 14, 15, 25, 20, 12, 50, 16, 18, 35, 28, 30, 125, 40, 24, 100, 32, 27, 11, 22, 21, 55, 44, 42, 70, 56, 45, 49, 98, 75, 175, 140, 60, 250, 80, 36, 245, 196, 150, 625, 200, 48, 500, 64, 54, 77, 110, 105, 275, 88, 84, 350, 112, 90, 343]