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 A195618 #27 Jan 25 2020 18:36:43 %S A195618 1,4,9,16,27,36,53,70,90,113,147,173,213,260,303,355,419,477,549,634, %T A195618 715,806,903,1013,1128,1255,1383,1525,1679,1842,2011,2189,2383,2585, %U A195618 2802,3021,3257,3509,3773,4044,4327,4629,4942,5273,5607,5961,6335,6724,7121 %N A195618 a(0) = 1; a(n) = A001208(n) + 1 for n > 0. %C A195618 Lunnon sometimes works with this sequence rather than A001208. A001208 is the main entry. %H A195618 W. F. Lunnon, <a href="https://doi.org/10.1093/comjnl/12.4.377">A postage stamp problem</a>, Comput. J. 12 (1969) 377-380. %Y A195618 Cf. A001208. %Y A195618 Column n=3 of the array A196416. %K A195618 nonn,more %O A195618 0,2 %A A195618 _N. J. A. Sloane_, Sep 23 2011 %E A195618 Definition amended by _Georg Fischer_, Jan 25 2020