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.

A175863 Numbers k > 1 such that 2^(k-1) == (2*k + 1) (mod k^2).

Table of values

n	a(n)
1	7
2	71
3	379
4	2659

List of values

[7, 71, 379, 2659]

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

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