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 A156752 #19 Aug 30 2024 18:09:28 %S A156752 1,2,2,2,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3, %T A156752 3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3, %U A156752 3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3 %N A156752 a(n) = floor(Catalan(n+1)/Catalan(n)). %C A156752 Decimal expansion of 3667/30000. - _Elmo R. Oliveira_, May 05 2024 %H A156752 <a href="/index/Rec#order_01">Index entries for linear recurrences with constant coefficients</a>, signature (1). %F A156752 a(n) = floor(A000108(n+1)/A000108(n)). %F A156752 G.f.: (1+x+x^4)/(1-x). %F A156752 a(0)=1, a(1) = a(2) = a(3) = 2, a(n) = 3 for n>3. %F A156752 E.g.f.: 3*exp(x) - 2 - x - x^2/2 - x^3/6. - _Elmo R. Oliveira_, Aug 09 2024 %F A156752 a(n) = floor(4^(n/(n+1))). - _Aaron J Grech_, Aug 30 2024 %Y A156752 Cf. A000108, A010701. %K A156752 nonn,easy %O A156752 0,2 %A A156752 _Philippe Deléham_, Feb 14 2009