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.

A256812 Smallest k>=1 such that n^6 + (n+1)^6 + ... + (n+k)^6 is prime or a(n)=0 if there is no such k.

Table of values

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

List of values

[0, 2, 0, 2, 0, 0, 0, 0, 5, 0, 0, 6, 20, 0, 0, 5, 20, 0, 20, 0, 5, 13, 5, 5, 0, 0, 0, 0, 5, 0, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 6, 20, 0, 41, 2, 0, 5, 13, 0, 0, 0, 0, 6, 0, 0, 0, 5, 0, 0, 0, 0, 0, 0, 0, 0, 5, 0, 20, 0, 20, 41, 0, 0, 0, 5, 0, 0, 0, 41, 0, 13, 20]

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

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