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.

A192439 a(n) = a(n-1) - a(n-2) if n is prime or a(n-1) + a(n-2) otherwise. a(1) = a(2) = 1.

Table of values

n a(n)
1 1
2 1
3 0
4 1
5 1
6 2
7 1
8 3
9 4
10 7
11 3
12 10
13 7
14 17
15 24
16 41
17 17
18 58
19 41
20 99
21 140
22 239
23 99
24 338
25 437
26 775
27 1212
28 1987
29 775
30 2762
31 1987
32 4749
33 6736
34 11485
35 18221
36 29706
37 11485
38 41191
39 52676
40 93867
41 41191
42 135058
43 93867
44 228925
45 322792
46 551717
47 228925
48 780642
49 1009567

List of values

[1, 1, 0, 1, 1, 2, 1, 3, 4, 7, 3, 10, 7, 17, 24, 41, 17, 58, 41, 99, 140, 239, 99, 338, 437, 775, 1212, 1987, 775, 2762, 1987, 4749, 6736, 11485, 18221, 29706, 11485, 41191, 52676, 93867, 41191, 135058, 93867, 228925, 322792, 551717, 228925, 780642, 1009567]