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.

A102433 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, 4, 12, 40, 132, 472, 1727, 6452, 24330, 92404, 352743, 1352116, 5200339, 20058347, 77558811, 300540260, 1166803176, 4537567732, 17672631983, 68923264512, 269128937327, 1052049481983, 4116715363924, 16123801841703
Offset: 1

Views

Author

Marc LeBrun, Jan 08 2005

Keywords

Examples

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

Crossrefs

Formula

a(n) = A102431(n) + A102430(n, 1) - 1