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.

A370455 a(n) = greatest m such that 2^m divides prime(n+1)*prime(n+2) - prime(n)*prime(n+3).

Table of values

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

List of values

[0, 1, 2, 3, 2, 3, 3, 1, 4, 1, 3, 3, 3, 1, 2, 4, 1, 4, 1, 1, 2, 2, 1, 1, 3, 2, 3, 3, 3, 2, 1, 2, 3, 2, 2, 1, 2, 1, 2, 2, 3, 1, 2, 4, 1, 3, 1, 3, 7, 1, 2, 2, 2, 3, 2, 4, 1, 3, 1, 2, 1, 3, 3, 3, 1, 2, 2, 1, 5, 2, 2, 1, 1, 2, 2, 1, 5, 1, 1, 3, 3, 2, 1, 2, 2, 1]