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.

A383594 a(0) = 0 and thereafter a(n) = 2 if a(n-1) is an odd prime, otherwise a(n) = a(n-1) + k where k = n - P(n) and P(n) is the number of odd primes among terms a(0),...,a(n-1).

Table of values

n a(n)
0 0
1 1
2 3
3 2
4 5
5 2
6 6
7 11
8 2
9 8
10 15
11 23
12 2
13 11
14 2
15 12
16 23
17 2
18 14
19 27
20 41
21 2
22 17
23 2
24 18
25 35
26 53
27 2
28 21
29 41
30 2
31 23
32 2
33 24
34 47
35 2
36 26
37 51
38 77
39 104
40 132
41 161
42 191
43 2
44 33
45 65
46 98
47 132
48 167
49 2
50 38
51 75
52 113
53 2
54 41
55 2
56 42
57 83
58 2
59 44
60 87
61 131
62 2
63 47
64 2
65 48
66 95
67 143
68 192
69 242

List of values

[0, 1, 3, 2, 5, 2, 6, 11, 2, 8, 15, 23, 2, 11, 2, 12, 23, 2, 14, 27, 41, 2, 17, 2, 18, 35, 53, 2, 21, 41, 2, 23, 2, 24, 47, 2, 26, 51, 77, 104, 132, 161, 191, 2, 33, 65, 98, 132, 167, 2, 38, 75, 113, 2, 41, 2, 42, 83, 2, 44, 87, 131, 2, 47, 2, 48, 95, 143, 192, 242]

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

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