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 A184103 #17 Jul 13 2022 14:47:55
%S A184103 1,2,3,4,6,8,10,11,14,16,18,20,23,26,29,31,35,38,41,44,48,52,56,59,64,
%T A184103 68,72,76,81,86,91,95,101,106,111,116,122,128,134,139,146,152,158,164,
%U A184103 171,178,185,191,199,206,213,220,228,236,244,251,260,268,276,284,293,302,311,319,329,338,347,356,366,376,386,395,406,416,426,436,447,458,469,479
%N A184103 a(n) = n-1+ceiling(n^2/16); complement of A184102.
%H A184103 <a href="/index/Rec#order_10">Index entries for linear recurrences with constant coefficients</a>, signature (2,-1,0,0,0,0,0,1,-2,1).
%F A184103 a(n) = n-1+ceiling(n^2/16).
%F A184103 a(n) = +2*a(n-1) -a(n-2) +a(n-8) -2*a(n-9) +a(n-10). - _R. J. Mathar_, Mar 11 2012
%t A184103 a=16; b=0;
%t A184103 Table[n+Floor[(a*n+b)^(1/2)],{n,100}] (* A184102 *)
%t A184103 Table[n-1+Ceiling[(n^2-b)/a],{n,80}] (* A184103 *)
%t A184103 LinearRecurrence[{2,-1,0,0,0,0,0,1,-2,1},{1,2,3,4,6,8,10,11,14,16},80] (* _Harvey P. Dale_, Jul 05 2019 *)
%o A184103 (PARI) a(n) = n-1+ceil(n^2/16); \\ _Michel Marcus_, Jul 13 2022
%Y A184103 Cf. A184102.
%K A184103 nonn,easy
%O A184103 1,2
%A A184103 _Clark Kimberling_, Jan 09 2011
%E A184103 Name and formula corrected by _Michel Marcus_, Jul 13 2022