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.

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

Table of values

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

List of values

[1, 2, 3, 3, 5, 5, 7, 7, 7, 7, 7, 11, 7, 13, 7, 13, 7, 13, 11, 13, 13, 13, 13, 13, 17, 13, 19, 17, 17, 13, 19, 17, 19, 17, 19, 17, 19, 19, 23, 19, 23, 23, 23, 23, 23, 23, 23, 29, 29, 29, 29, 29, 29, 31, 31, 31, 31, 37, 31, 31, 31, 37, 31, 37, 31, 37, 31, 37, 31, 41, 31, 41, 37, 37, 37, 41, 37, 41, 41, 43]

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

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