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.

A058064 Find least k such that (n+1)^k + n^k is a prime (A057856); then k=2^m and sequence gives values of m.

Table of values

n a(n)
1 0
2 0
3 0
4 1
5 0
6 0
7 1
8 0
9 0
10 5
11 0
12 1
13 2
14 0
15 0
16 2
17 1
18 0
19 1
20 0
21 0
22 1
23 0
24 1
25 1
26 0
27 2

List of values

[0, 0, 0, 1, 0, 0, 1, 0, 0, 5, 0, 1, 2, 0, 0, 2, 1, 0, 1, 0, 0, 1, 0, 1, 1, 0, 2]