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 A196069 #19 Nov 14 2020 02:00:39 %S A196069 1,5,13,25,45,72,115,166,235,327,428,548,709,874,1095,1384,1651,1936, %T A196069 2305,2783,3325,3813,4369,5131,5893,6746,7881,8914,9920,11082,12377, %U A196069 13933,15658,17243,18893,21062,23446,25554,27979,31348,33982,36807,39915,43593 %N A196069 a(n) = A001209(n) + 1. %C A196069 Lunnon sometimes works with this sequence rather than A001209. A001209 is the main entry. %H A196069 Hakan Icoz, <a href="/A196069/b196069.txt">Table of n, a(n) for n = 0..54</a> %H A196069 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 A196069 Cf. A001209. %Y A196069 A row or column of the array A196416 (possibly with 1 subtracted from it). %K A196069 nonn %O A196069 0,2 %A A196069 _N. J. A. Sloane_, Sep 27 2011 %E A196069 More terms from _Hakan Icoz_, Nov 13 2020