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.

A253176 Least k>=0 such that both 3n*2^k+1 and 3n*2^k-1 are primes, or -1 if no such k exists.

Table of values

n a(n)
1 1
2 0
3 1
4 0
5 1
6 0
7 1
8 3
9 2
10 0
11 6
12 1
13 3
14 0
15 2
16 2
17 1
18 1
19 2
20 0
21 14
22 5
23 1
24 0
25 1
26 2
27 5
28 5
29 2
30 1
31 4
32 1
33 1
34 0
35 2
36 0

List of values

[1, 0, 1, 0, 1, 0, 1, 3, 2, 0, 6, 1, 3, 0, 2, 2, 1, 1, 2, 0, 14, 5, 1, 0, 1, 2, 5, 5, 2, 1, 4, 1, 1, 0, 2, 0]