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.

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

Table of values

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

List of values

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

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

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