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.

A362842 a(1) = 1; a(2) = 2; for n > 2, a(n) is the smallest positive number that has not yet appeared that shares a factor with a(n-1) when both a(n-1) and a(n) are read as numbers in bases from one more than the maximum digit in a(n-1) and a(n), up to base 10.

Table of values

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

List of values

[1, 2, 4, 6, 3, 9, 12, 24, 8, 20, 10, 30, 33, 11, 22, 26, 13, 39, 15, 48, 28, 14, 49, 7, 70, 16, 38, 19, 57, 69, 18, 56, 76, 36, 60, 40, 42, 21, 63, 66, 44, 46, 23, 92, 32, 64, 62, 31, 93, 27, 90, 5, 50, 55, 77, 84, 35, 80, 68, 17, 119, 34, 94, 47, 329, 91, 52, 96, 45, 95, 25, 190, 54, 98, 58, 29]