login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A051165 Sequence is defined by property that binomial transform of (a0,a1,a2,a3,...) = (a0,a0,a1,a1,a2,a2,a3,a3,...). 5

%I #13 Jun 04 2018 03:11:55

%S 1,0,-1,2,-4,8,-12,8,15,-56,81,-26,-130,208,306,-2060,4796,-5120,

%T -6140,43320,-113768,182720,-111768,-395696,1725172,-3922016,5614348,

%U -2289912,-14957416,56700032,-121684568,164735504,-47657969,-491084768,1740799985,-3598600386,4619098604

%N Sequence is defined by property that binomial transform of (a0,a1,a2,a3,...) = (a0,a0,a1,a1,a2,a2,a3,a3,...).

%H Alois P. Heinz, <a href="/A051165/b051165.txt">Table of n, a(n) for n = 0..1000</a>

%H N. J. A. Sloane, <a href="/transforms.txt">Transforms</a>

%p a:= proc(n) option remember; add(`if`(k<2, 1,

%p a(iquo(k, 2)))*(-1)^(n-k)*binomial(n, k), k=0..n)

%p end:

%p seq(a(n), n=0..45); # _Alois P. Heinz_, Jul 08 2015

%t a[n_] := a[n] = Sum[If[k<2, 1, a[Quotient[k, 2]]]*(-1)^(n-k)*Binomial[n, k], {k, 0, n}];

%t Table[a[n], {n, 0, 45}] (* _Jean-François Alcover_, Jun 04 2018, from Maple *)

%Y Cf. A051163, A051164, A051166.

%K easy,sign,eigen

%O 0,4

%A _Jonas Wallgren_

%E More terms from _Vladeta Jovovic_, Jul 26 2002

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 05:56 EDT 2024. Contains 371964 sequences. (Running on oeis4.)