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 A099035 #27 Dec 28 2022 13:35:58 %S A099035 1,5,15,39,95,223,511,1151,2559,5631,12287,26623,57343,122879,262143, %T A099035 557055,1179647,2490367,5242879,11010047,23068671,48234495,100663295, %U A099035 209715199,436207615,905969663,1879048191,3892314111,8053063679 %N A099035 a(n) = (n+1)*2^(n-1) - 1. %C A099035 Row sums of triangle A135852. - _Gary W. Adamson_, Dec 01 2007 %C A099035 Binomial transform of [1, 4, 6, 8, 10, 12, 14, 16, ...]. Equals A128064 * A000225, (A000225 starting 1, 3, 7, 15, ...). - _Gary W. Adamson_, Dec 28 2007 %H A099035 G. C. Greubel, <a href="/A099035/b099035.txt">Table of n, a(n) for n = 1..1000</a> %H A099035 <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (5,-8,4). %F A099035 a(n) = A057711(n+1) - 1 = A058966(n+3)/2 = (A087323(n)-1)/2 = (A074494(n+1)-2)/3 = (A003261(n+1)-3)/4 = A036289(n+1)/4 - 1, n>0. %F A099035 a(n) = A131056(n+1) - 2. - _Juri-Stepan Gerasimov_, Oct 02 2011 %F A099035 From _Colin Barker_, Mar 23 2012: (Start) %F A099035 a(n) = 5*a(n-1) - 8*a(n-2) + 4*a(n-3). %F A099035 G.f.: x*(1-2*x^2)/((1-x)*(1-2*x)^2). (End) %F A099035 E.g.f.: ((2*x+1)*exp(2*x) - 2*exp(x) + 1)/2. - _G. C. Greubel_, Dec 31 2017 %t A099035 Table[(n + 1)*2^(n - 1) - 1, {n,1,30}] (* _G. C. Greubel_, Dec 31 2017 *) %t A099035 LinearRecurrence[{5,-8,4},{1,5,15},30] (* _Harvey P. Dale_, Dec 28 2022 *) %o A099035 (PARI) a(n)=(n+1)*2^(n-1)-1 \\ _Charles R Greathouse IV_, Oct 07 2015 %o A099035 (Magma) [(n+1)*2^(n-1) -1: n in [1..30]]; // _G. C. Greubel_, Dec 31 2017 %Y A099035 First differences of A066524. %Y A099035 Cf. A135852, A128064, A000225. %K A099035 nonn,easy %O A099035 1,2 %A A099035 _Ralf Stephan_, Sep 28 2004