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 A114119 #22 Feb 21 2023 10:37:11
%S A114119 1,3,5,6,8,9,11,12,14,15,17,18,20,21,23,24,26,27,29,30,32,33,35,36,38,
%T A114119 39,41,42,44,45,47,48,50,51,53,54,56,57,59,60,62,63,65,66,68,69,71,72,
%U A114119 74,75,77,78,80,81,83,84,86,87,89,90,92,93,95,96,98,99,101,102,104,105
%N A114119 Row sums of triangle A114118.
%C A114119 Taken modulo 3 yields 1,0,2,0,2,0,2,0,2,...; a(n) is congruent to 0 or 2 (mod 3) for n > 0.
%H A114119 <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (1,1,-1).
%F A114119 a(n) = 3*floor((n + 1)/2) + 2*((n+1) mod 2) - 0^n.
%F A114119 a(n) = Sum_{k=0..n} Sum_{j=0..n} binomial(floor((n + k + j)/3), k)*binomial(k, floor((n + k + j)/3)).
%F A114119 G.f.: 1 - x*(-3 - 2*x + 2*x^2)/((1 + x)*(x - 1)^2). - _R. J. Mathar_, Oct 25 2011
%F A114119 E.g.f.: ((4 + 3*x)*cosh(x) + 3*(1 + x)*sinh(x) - 2)/2. - _Stefano Spezia_, Feb 20 2023
%t A114119 Join[{1,3},LinearRecurrence[{1,1,-1},{5,6,8},100]] (* _Vladimir Joseph Stephan Orlovsky_, Jan 31 2012 *)
%Y A114119 Cf. A007494, A049636, A045506.
%K A114119 easy,nonn
%O A114119 0,2
%A A114119 _Paul Barry_, Nov 13 2005