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.

A109465 a(1)=1; for n>1, a(n) = smallest positive integer not among the earlier terms of the sequence that is divisible by a different number of distinct primes than a(n-1).

Table of values

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

List of values

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