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!)
A358603 a(n) = Sum_{k=0..floor(n/2)} (-1)^k * (n-k)!/(n-2*k)!. 4

%I #16 Jul 25 2024 14:52:58

%S 1,1,0,-1,0,3,2,-9,-12,35,78,-153,-544,723,4170,-3337,-35028,10851,

%T 320678,57255,-3178152,-2190253,33864546,42120183,-385314460,

%U -719159517,4649508222,12033407591,-59076411312,-204022615725,784134861818,3554417974647,-10768948801764

%N a(n) = Sum_{k=0..floor(n/2)} (-1)^k * (n-k)!/(n-2*k)!.

%H Seiichi Manyama, <a href="/A358603/b358603.txt">Table of n, a(n) for n = 0..899</a>

%F a(n) = (a(n-1) - n * a(n-2) + 1)/2 for n > 1.

%t nxt[{n_,a_,b_}]:={n+1,b,(b-a(n+1)+1)/2}; NestList[nxt,{1,1,1},40][[;;,2]] (* _Harvey P. Dale_, Jul 25 2024 *)

%o (PARI) a(n) = sum(k=0, n\2, (-1)^k*(n-k)!/(n-2*k)!);

%Y Cf. A358604, A358605, A358606.

%Y Cf. A122852.

%K sign

%O 0,6

%A _Seiichi Manyama_, Nov 23 2022

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 September 15 17:47 EDT 2024. Contains 375954 sequences. (Running on oeis4.)