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 A005662 M3375 #38 Feb 29 2024 10:49:33 %S A005662 4,10,15,22,32,33,46,48,66,68,69,94,98,99,102,134,138,140,141,147,190, %T A005662 198,200,201,206,207,210,270,278,282,284,285,296,297,300,309,382,398, %U A005662 402,404,405,414,416,417,422,423,426,444,542,558,566,570,572,573,594 %N A005662 Start with 4; if k appears then so do 2k+2 and 3k+3. (duplicates omitted.) %D A005662 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence). %H A005662 Seiichi Manyama, <a href="/A005662/b005662.txt">Table of n, a(n) for n = 1..10000</a> %H A005662 R. K. Guy, <a href="/A005658/a005658.pdf">Letter to N. J. A. Sloane with attachment, 1982</a> %e A005662 208857, 313286 and 626574 are terms and 626574 = 2*313286 + 2 = 3*208857 + 3. - _Seiichi Manyama_, Feb 29 2024 %Y A005662 Cf. A005660. %K A005662 nonn,easy %O A005662 1,1 %A A005662 _N. J. A. Sloane_ %E A005662 More terms from Larry Reeves (larryr(AT)acm.org), Oct 01 2001