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.

A239723 Least number k such that n^k + (n+1)^k + ... + (n+k-1)^k is prime or 0 if no such number exists.

Table of values

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

List of values

[2, 1, 1, 2, 1, 0, 1, 0, 2, 0, 1, 2, 1, 2, 0, 6, 1, 0, 1, 0, 6, 2, 1, 2, 2, 0, 0, 0, 1, 2, 1, 2, 0, 2, 2, 0, 1, 0, 2, 0, 1, 2, 1, 0, 0, 0, 1, 6, 0, 2, 0, 0, 1, 0, 0, 0, 0, 6, 1, 2, 1, 0, 0, 0, 2, 0, 1, 0, 2, 2, 1, 2, 1, 0, 0, 6, 0, 0, 1, 0, 0, 2, 1, 2, 2, 0, 2, 0, 1, 2, 6]