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.

A102432 Number of distinct polynomials of degree < n and coefficients > 0 with solutions k > 1 such that p(k) = n.

Original entry on oeis.org

1, 2, 3, 6, 7, 11, 12, 18, 21, 27, 28, 39, 40, 48, 52, 66, 67, 83, 84, 103, 108, 124, 125, 154, 157, 179, 186, 217, 218, 255, 256, 298, 305, 343, 347, 409, 410, 458, 467, 536, 537, 610, 611, 691, 705, 781, 782, 896, 899, 999, 1010, 1131, 1132, 1264, 1269, 1419
Offset: 1

Views

Author

Marc LeBrun, Jan 08 2005

Keywords

Examples

			a(4)=6 distinct polynomials: 4 (for all n), n+2, 2n, n^2 (for n=2), n+1 (for n=3), n (for n=4).
		

Crossrefs

Formula

a(n) = A102431(n) - n + 2