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 A269416 #9 Jun 07 2016 13:53:22 %S A269416 6,-9,15,-18,24,-27,33,-36,42,-45,51,-54,60,-63,69,-72,78,-81,87,-90, %T A269416 96,-99,105,-108,114,-117,123,-126,132,-135,141,-144,150,-153,159, %U A269416 -162,168,-171,177,-180,186,-189,195,-198,204,-207,213,-216,222,-225,231,-234,240 %N A269416 Expansion of 3*(2 - x)/((1 - x)*(1 + x)^2). %C A269416 Alternating sum of A017233. %H A269416 <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (-1,1,1). %F A269416 G.f.: 3*(2 - x)/((1 - x)*(1 + x)^2). %F A269416 a(n) = -a(n-1) + a(n-2) + a(n-3). %F A269416 a(n) = Sum_{k=0..n} (-1)^k*3*(3*k + 2). %F A269416 a(n) = 3*((-1)^n*6*n + (-1)^n*7 + 1)/4. %F A269416 Sum_{n>=0} 1/a(n) = log(3)/6 - Pi/(18*sqrt(3)) = 0.082335416765006179088425414... . - _Vaclav Kotesovec_, Feb 25 2016 %F A269416 a(n) = 3*(-1)^n*A007494(n+1). - _R. J. Mathar_, Jun 07 2016 %e A269416 a(0) = 1 + 2 + 3 = 6; %e A269416 a(1) = 1 + 2 + 3 - 4 - 5 - 6 = -9; %e A269416 a(2) = 1 + 2 + 3 - 4 - 5 - 6 + 7 + 8 + 9 = 15; %e A269416 a(3) = 1 + 2 + 3 - 4 - 5 - 6 + 7 + 8 + 9 - 10 - 11 - 12 = -18; %e A269416 a(4) = 1 + 2 + 3 - 4 - 5 - 6 + 7 + 8 + 9 - 10 - 11 - 12 + 13 + 14 + 15 = 24, etc. %t A269416 LinearRecurrence[{-1, 1, 1}, {6, -9, 15}, 53] %t A269416 Table[3 ((6 (-1)^n n + 7 (-1)^n + 1)/4), {n, 0, 52}] %Y A269416 Cf. A000027, A017233. %K A269416 sign,easy %O A269416 0,1 %A A269416 _Ilya Gutkovskiy_, Feb 25 2016