The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A051166 Sequence is defined by property that binomial transform of (a0,a1,a2,a3,...) = (a0,a0,a0,a1,a1,a1,a2,a2,a2,a3,a3,a3,...). 5

%I #13 Apr 04 2017 08:06:23

%S 1,0,0,-1,3,-6,10,-15,21,-29,45,-90,224,-609,1677,-4559,12135,-31542,

%T 80086,-199035,485469,-1165105,2757369,-6446778,14913052,-34175805,

%U 77672325,-175228740,392711166,-874901088,1938704130,-4275110880,9385473510,-20521355211,44704157499,-97055415324

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

%H Alois P. Heinz, <a href="/A051166/b051166.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<3, 1,

%p a(iquo(k, 3)))*(-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<3, 1, a[Quotient[k, 3]]]*(-1)^(n-k)*Binomial[n, k], {k, 0, n}];

%t Table[a[n], {n, 0, 45}] (* _Jean-François Alcover_, Apr 04 2017, after _Alois P. Heinz_ *)

%Y Cf. A051163, A051164, A051165.

%K easy,sign,eigen

%O 0,5

%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 May 18 21:39 EDT 2024. Contains 372666 sequences. (Running on oeis4.)