Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #10 Oct 21 2024 04:31:15
%S 1,1,2,2,4,5,8,11,18,25,40,59,90,137,210,319,492,754,1164,1798,2786,
%T 4317,6710,10438,16266,25377,39650,62013,97108,152212,238822,375058,
%U 589520,927365,1459960,2300097,3626211,5720649,9030450,14263675
%N a(n) = Sum_{k = 0..floor(n/2)} floor(C(n-k,k)/(k+1)).
%C Sums of diagonal entries in A011847.
%H G. C. Greubel, <a href="/A095719/b095719.txt">Table of n, a(n) for n = 1..1000</a>
%F a(n) = Sum_{k=0..floor(n/2)} floor(C(n-k,k)/(k+1)).
%p a:=n->add(floor(C(n-k,k)/(k+1)),k=0..n/2);
%t Table[Sum[Floor[Binomial[n-k,k]/(k+1)],{k,0,n/2}],{n,40}] (* _Harvey P. Dale_, Apr 02 2019 *)
%o (Magma)
%o A095719:= func< n | (&+[Floor(Binomial(n-k,k)/(k+1)): k in [0..Floor(n/2)]]) >;
%o [A095719(n): n in [1..40]]; // _G. C. Greubel_, Oct 21 2024
%o (SageMath)
%o def A095719(n): return sum(binomial(n-k,k)//(k+1) for k in range(n//2+1))
%o [A095719(n) for n in range(1,41)] # _G. C. Greubel_, Oct 21 2024
%Y Cf. A011847, A095718.
%K nonn
%O 1,3
%A _Mike Zabrocki_, Jul 08 2004