login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A082406 Numbers n such that n divides sum(k=1,n, C(2k,k)). 1
1, 2, 5, 8, 11, 12, 17, 23, 29, 41, 47, 53, 59, 71, 83, 89, 101, 107, 113, 130, 131, 137, 149, 167, 173, 179, 191, 196, 197, 227, 233, 238, 239, 251, 257, 263, 266, 269, 281, 293, 311, 317, 322, 347, 353, 359, 383, 389, 401, 419, 431, 443, 449, 461, 467, 479 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Vaclav Kotesovec, Table of n, a(n) for n = 1..4973

Vaclav Kotesovec, Plot of a(n)/(n*log(n)) for n = 2..10000

FORMULA

Is a(n) asymptotic to c*n*log(n) with 2<c<2.3 ?

MATHEMATICA

Select[Range[500], Divisible[Sum[Binomial[2k, k], {k, #}], #]&] (* Harvey P. Dale, Feb 16 2013 *)

A066796 = Accumulate[Table[Binomial[2*k, k], {k, 1, 1000}]]; Select[Range[Length[A066796]], Divisible[A066796[[#]], #] &] (* Vaclav Kotesovec, Feb 15 2019 *)

CROSSREFS

Cf. A066796.

Sequence in context: A083422 A187581 A167409 * A215938 A007826 A108589

Adjacent sequences:  A082403 A082404 A082405 * A082407 A082408 A082409

KEYWORD

nonn

AUTHOR

Benoit Cloitre, Apr 23 2003

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 25 10:38 EDT 2020. Contains 337337 sequences. (Running on oeis4.)