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.

A127562 a(1)=1. a(2)=2. For n>=3, a(n) is the smallest positive integer not occurring earlier in the sequence such that (Sum_{k=1..n} a(k)) divides Product_{j=1..n} a(j).

Table of values

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

List of values

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