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.

A137797 a(n) = 2*( (n+1) mod 5 ) - 2*( (n+1) mod 2 ).

Table of values

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

List of values

[0, 4, 4, 8, -2, 2, 2, 6, 6, 0, 0, 4, 4, 8, -2, 2, 2, 6, 6, 0, 0, 4, 4, 8, -2, 2, 2, 6, 6, 0, 0, 4, 4, 8, -2, 2, 2, 6, 6, 0, 0, 4, 4, 8, -2, 2, 2, 6, 6, 0, 0, 4, 4, 8, -2, 2, 2, 6, 6, 0, 0, 4, 4, 8, -2, 2, 2, 6, 6, 0, 0, 4, 4, 8, -2, 2, 2, 6, 6]

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

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