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.
%I A102433 #3 Mar 30 2012 17:38:11 %S A102433 1,4,12,40,132,472,1727,6452,24330,92404,352743,1352116,5200339, %T A102433 20058347,77558811,300540260,1166803176,4537567732,17672631983, %U A102433 68923264512,269128937327,1052049481983,4116715363924,16123801841703 %N A102433 Number of distinct polynomials of degree < n and coefficients > 0 with solutions k >= 1 such that p(k) = n. %F A102433 a(n) = A102431(n) + A102430(n, 1) - 1 %e A102433 a(2)=4 distinct polynomials: 2 (for all n), n+1, 2n (for n=1), n (for n=2). %Y A102433 Cf. A102430, A102431, A102432, A102434. %K A102433 easy,nonn %O A102433 1,2 %A A102433 _Marc LeBrun_, Jan 08 2005