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.

A379757 a(n) = a(n-1) + 1 with two exceptions: if a(n-1) is prime, a(n) = a(n-2) + a(n-1), or if a(n-1) is a power, a(n) = a(n-1) / (root factor), with initial three terms are 0, 1, 2.

Table of values

n a(n)
1 0
2 1
3 2
4 3
5 5
6 8
7 4
8 2
9 6
10 7
11 13
12 20
13 21
14 22
15 23
16 45
17 46
18 47
19 93
20 94
21 95
22 96
23 97
24 193
25 290
26 291
27 292
28 293
29 585
30 586
31 587
32 1173
33 1174
34 1175
35 1176
36 1177
37 1178
38 1179
39 1180
40 1181
41 2361
42 2362
43 2363
44 2364
45 2365
46 2366
47 2367
48 2368
49 2369
50 2370
51 2371
52 4741
53 4742
54 4743

List of values

[0, 1, 2, 3, 5, 8, 4, 2, 6, 7, 13, 20, 21, 22, 23, 45, 46, 47, 93, 94, 95, 96, 97, 193, 290, 291, 292, 293, 585, 586, 587, 1173, 1174, 1175, 1176, 1177, 1178, 1179, 1180, 1181, 2361, 2362, 2363, 2364, 2365, 2366, 2367, 2368, 2369, 2370, 2371, 4741, 4742, 4743]