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.

A284397 a(1) = 1, a(2) = 2; a(n) is the largest prime <= (a(a(n-1)) + a(n-a(n-2)-1)) for n > 2.

Table of values

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

List of values

[1, 2, 3, 3, 3, 5, 5, 5, 5, 5, 5, 7, 7, 7, 7, 7, 7, 7, 7, 11, 11, 7, 7, 11, 11, 11, 11, 11, 11, 11, 11, 13, 17, 17, 13, 13, 13, 17, 17, 13, 13, 17, 17, 17, 17, 17, 17, 17, 17, 19, 23, 19, 17, 23, 19, 19, 19, 23, 23, 19, 19, 23, 23, 19, 19, 23, 23, 23, 23, 23, 23, 23, 23, 23]

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

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