cp's OEIS Frontend

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.

A127276 Hankel transform of A127275.

This page as a plain text file.
%I A127276 #31 Sep 08 2022 08:45:29
%S A127276 1,1,-2,-16,-64,-208,-608,-1664,-4352,-11008,-27136,-65536,-155648,
%T A127276 -364544,-843776,-1933312,-4390912,-9895936,-22151168,-49283072,
%U A127276 -109051904,-240123904,-526385152,-1149239296,-2499805184,-5419040768
%N A127276 Hankel transform of A127275.
%C A127276 The inverse binomial transform of this sequence yields 1, 0, -3, -8,..., which is 1 followed by the negated terms of A005563. [_Paul Curtz_, Dec 07 2010]
%C A127276 The smallest odd prime divisor of a(n) is >= 13. - _Vladimir Shevelev_, Feb 03 2014
%H A127276 Vincenzo Librandi, <a href="/A127276/b127276.txt">Table of n, a(n) for n = 0..1000</a>
%F A127276 Conjecture: G.f.: -(4*x-1)*(x-1) / ( (2*x-1)^3 ) and a(n) = 2^n-n*(n+1)*2^(n-2). - _R. J. Mathar_, Dec 11 2010
%F A127276 a(n) = A178987(n) - A178987(n+1). - _Klaus Brockhaus_, Jan 08 2011
%p A127276 A127276:=n->2^n - n*(n + 1)*2^(n - 2); seq(A127276(n), n=0..26); # _Wesley Ivan Hurt_, Dec 02 2013
%t A127276 Table[2^n - n*(n + 1)*2^(n - 2), {n, 0, 26}] (* _Wesley Ivan Hurt_, Dec 02 2013 *)
%o A127276 (Magma) [2^n-n*(n+1)*2^(n-2): n in [0..30]]; // _Vincenzo Librandi_, Aug 11 2011
%Y A127276 Cf. A076616, A176126, A236999.
%K A127276 sign
%O A127276 0,3
%A A127276 _Paul Barry_, Jan 10 2007