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
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, 101, 105, 105, 106, 142, 143, 143, 153, 172, 165, 222, 223, 216, 259, 278, 279, 256, 257, 327, 394, 295, 296, 422, 374, 318, 328, 384, 385, 420, 469, 461, 465, 450, 451 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
LINKS
FORMULA
a(n) seems to be asymptotic to c*n^2 with c around 0.18...
PROG
(PARI) a(n)=sum(k=1, n, binomial(n, k)%k)
CROSSREFS
Row sums of A081371.
Sequence in context: A319860 A300354 A091681 * A227380 A159789 A153932
KEYWORD
nonn
AUTHOR
Benoit Cloitre, Oct 19 2002
STATUS
approved

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 11 20:45 EDT 2024. Contains 372414 sequences. (Running on oeis4.)