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.

A358267 a(1) = 1, a(2) = 2. Thereafter:(i). If no prime divisor of a(n-1) divides a(n-2), a(n) is the least novel multiple of the squarefree kernel of a(n-1). (ii). If some (but not all) prime divisors of a(n-1) do not divide a(n-2), a(n) is the least of the least novel multiples of all such primes. (iii). If every prime divisor of a(n-1) also divides a(n-2), a(n) = u, the least unused number.

Table of values

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

List of values

[1, 2, 4, 3, 6, 8, 5, 10, 12, 9, 7, 14, 16, 11, 22, 18, 15, 20, 24, 21, 28, 26, 13, 17, 34, 30, 25, 19, 38, 32, 23, 46, 36, 27, 29, 58, 40, 35, 42, 33, 44, 48, 39, 52, 50, 45, 51, 68, 54, 57, 76, 56, 49, 31, 62, 60, 55, 66, 63, 70, 64, 37, 74, 72, 69, 92, 78, 65]

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

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