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.

A354516 Smallest k such that m - gpf(m) = k has exactly n solutions m >= 2, gpf = A006530; or -1 if no such k exists.

Table of values

n	a(n)
0	1
1	2
2	6
3	483
4	1660577

List of values

[1, 2, 6, 483, 1660577]

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

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