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!)
A273160 a(n) = Sum_{k=1..n} C(n, floor((n-k)/k)). 3

%I #10 May 28 2021 03:38:27

%S 0,1,3,5,10,13,30,39,84,143,290,424,1120,1697,3521,6633,14012,22721,

%T 53529,88607,189749,356024,730697,1256272,2889484,5006918,10399649,

%U 19706342,40954970,72663140,160499071,286286349,597385864,1134282375,2340807724,4251969339

%N a(n) = Sum_{k=1..n} C(n, floor((n-k)/k)).

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

%p A273160:=n->add(binomial(n,floor((n-i)/i)), i=1..n): seq(A273160(n), n=0..50);

%t Table[Sum[Binomial[n, Floor[(n - i)/i]], {i, n}], {n, 0, 40}]

%Y Cf. A051054, A273161.

%K nonn,easy

%O 0,3

%A _Wesley Ivan Hurt_, May 16 2016

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 07:41 EDT 2024. Contains 371964 sequences. (Running on oeis4.)