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.

A095258 a(n+1) is the smallest divisor of (2 + sum of first n terms) but not occurring earlier; a(1) = 1.

Table of values

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

List of values

[1, 3, 2, 4, 6, 9, 27, 18, 8, 5, 17, 34, 68, 12, 24, 10, 25, 11, 13, 23, 7, 47, 94, 235, 15, 16, 32, 48, 51, 289, 578, 102, 36, 26, 73, 219, 30, 20, 14, 46, 50, 470, 60, 40, 146, 21, 49, 28, 113, 29, 19, 35, 42, 54, 64, 22, 77, 329, 84, 56, 292, 365, 65, 37, 131, 38, 33]

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

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