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

%I #10 Jan 31 2017 03:04:48

%S 0,1,2,2,3,8,9,11,6,13,14,26,27,28,32,46,47,49,50,68,81,82,83,116,102,

%T 101,105,105,106,142,143,143,153,172,165,222,223,216,259,278,279,256,

%U 257,327,394,295,296,422,374,318,328,384,385,420,469,461,465,450,451

%N a(n) = Sum_{k=1..n} C(n,k) mod k.

%H Paolo P. Lava, <a href="/A076541/b076541.txt">Table of n, a(n) for n = 1..2500</a>

%F a(n) seems to be asymptotic to c*n^2 with c around 0.18...

%o (PARI) a(n)=sum(k=1,n,binomial(n,k)%k)

%Y Row sums of A081371.

%K nonn

%O 1,3

%A _Benoit Cloitre_, Oct 19 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 23 05:59 EDT 2024. Contains 372758 sequences. (Running on oeis4.)