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.

A259230 a(n) = smallest k such that (A115091(n)-k)! == -1 (mod A115091(n)^2).

Table of values

n	a(n)
1	1
2	6
3	1
4	24
5	64
6	1
7	384

List of values

[1, 6, 1, 24, 64, 1, 384]

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

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