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!)
A343845 a(n) = Sum_{k=0..floor(n/2)} A109449(n-k, k). 0

%I #8 May 06 2021 13:35:19

%S 1,1,2,4,9,27,93,392,1898,10493,64885,443916,3326317,27085015,

%T 238073306,2246348560,22643042325,242808804441,2759740869777,

%U 33138397797908,419171443909394,5570771017483187,77603014042711369,1130712331125929112,17198408830271090233

%N a(n) = Sum_{k=0..floor(n/2)} A109449(n-k, k).

%F a(n) ~ 2^(n+2) * n! / Pi^(n+1). - _Vaclav Kotesovec_, May 06 2021

%p seq(add(A109449(n-k, k), k = 0..n/2), n = 0..25);

%t Table[Sum[Binomial[n-k,k] * 2^(n-2*k) * Abs[EulerE[n-2*k,1/2] + EulerE[n-2*k,1]], {k,0,Floor[n/2]}] - (1 + (-1)^n)/2, {n,0,25}] (* _Vaclav Kotesovec_, May 06 2021 *)

%Y Cf. A109449.

%K nonn

%O 0,3

%A _Peter Luschny_, May 06 2021

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 August 7 22:43 EDT 2024. Contains 375018 sequences. (Running on oeis4.)