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.

A077659 a(n) = smallest k>1 such that the sum n^k + (n+1)^k is prime, or -1 if no such k exists.

Table of values

n	a(n)
1	2
2	2
3	4
4	2
5	2
6	4
7	2
8	4
9	2
10	32

List of values

[2, 2, 4, 2, 2, 4, 2, 4, 2, 32]

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

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