Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A076541
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A076541 a(n) = sum(k=1, n, C(n,k) mod k ). +0
1
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; listen)
OFFSET

1,3

FORMULA

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

PROGRAM

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

CROSSREFS

Row sums of A081371.

Sequence in context: A153944 A046652 A091681 this_sequence A159789 A153932 A158763

Adjacent sequences: A076538 A076539 A076540 this_sequence A076542 A076543 A076544

KEYWORD

nonn

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), Oct 19 2002

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 23 17:09 EST 2009. Contains 167438 sequences.


AT&T Labs Research