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.

A361133 a(n) = n for n <= 3. Let h, i, j represent a(n-3), a(n-2), a(n-1) respectively. For n > 3, if there is a symmetric difference in the sets of distinct primes dividing h and j, with greatest member p then a(n) is the least novel multiple of p. Otherwise, a(n) is the least novel k such that (k,i) > 1.

Table of values

n a(n)
1 1
2 2
3 3
4 6
5 9
6 4
7 12
8 8
9 10
10 5
11 15
12 18
13 20
14 21
15 7
16 14
17 24
18 28
19 16
20 27
21 35
22 42
23 49
24 25
25 56
26 22
27 11
28 33
29 30
30 44
31 36
32 40
33 55
34 66
35 77
36 63
37 88
38 70
39 45
40 99
41 110
42 121
43 39
44 13
45 26
46 48
47 52
48 32
49 51
50 17
51 34
52 54
53 68
54 38
55 19
56 57
57 60
58 76
59 69
60 23
61 46
62 72
63 92
64 50
65 65
66 115
67 138
68 161
69 84
70 184

List of values

[1, 2, 3, 6, 9, 4, 12, 8, 10, 5, 15, 18, 20, 21, 7, 14, 24, 28, 16, 27, 35, 42, 49, 25, 56, 22, 11, 33, 30, 44, 36, 40, 55, 66, 77, 63, 88, 70, 45, 99, 110, 121, 39, 13, 26, 48, 52, 32, 51, 17, 34, 54, 68, 38, 19, 57, 60, 76, 69, 23, 46, 72, 92, 50, 65, 115, 138, 161, 84, 184]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.