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 A106472 #50 Jul 11 2025 18:23:10
%S A106472 1,3,7,17,40,92,208,464,1024,2240,4864,10496,22528,48128,102400,
%T A106472 217088,458752,966656,2031616,4259840,8912896,18612224,38797312,
%U A106472 80740352,167772160,348127232,721420288,1493172224,3087007744,6375342080,13153337344,27111981056
%N A106472 Expansion of g.f. (1 - x)^2*(1 + x) / (1 - 2*x)^2.
%C A106472 Binomial transform of A029578(n+2). Row sums of number triangle A106471.
%C A106472 a(n) is the number of parts equal to 1 or 2 in all the compositions of n + 1. Example: a(2)=7 because in the compositions [3], [1,2], [2,1], and [1,1,1] we have 0 + 2 + 2 + 3 = 7 parts equal to 1 or 2. Equivalently, a(n) = Sum_{k>=0} k*A296559(n+1,k). - _Emeric Deutsch_, Dec 16 2017
%C A106472 a(n) is the number of runs of 1s of length <= 2 over all binary strings of length n+1. - _Félix Balado_, Jun 28 2025
%H A106472 Colin Barker, <a href="/A106472/b106472.txt">Table of n, a(n) for n = 0..1000</a>
%H A106472 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (4,-4).
%F A106472 a(0)=1, a(1)=3, and a(n) = (3*n + 8)*2^(n-3), for n>=2. [simplified by _Ralf Stephan_, Nov 16 2010]
%F A106472 a(n) = 4*a(n-1) - 4*a(n-2) for n > 3. - _Colin Barker_, Dec 16 2017
%F A106472 E.g.f.: (exp(2*x)*(4 + 3*x) + x)/4. - _Stefano Spezia_, May 14 2023
%p A106472 1, 3, seq((3*n+8)*2^(n-3), n = 2 .. 27); # _Emeric Deutsch_, Dec 16 2017
%t A106472 Join[{1, 3}, LinearRecurrence[{4, -4}, {7, 17}, 30]] (* _Jean-François Alcover_, Dec 16 2017 *)
%o A106472 (PARI) my(x='x+O('x^99)); Vec((1+x)*(1-x)^2/(1-2*x)^2) \\ _Altug Alkan_, Dec 16 2017
%Y A106472 Cf. A029578, A106471, A296559.
%K A106472 easy,nonn
%O A106472 0,2
%A A106472 _Paul Barry_, May 03 2005