This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A082406 #16 Feb 14 2021 13:01:22
%S A082406 1,2,5,8,11,12,17,23,29,41,47,53,59,71,83,89,101,107,113,130,131,137,
%T A082406 149,167,173,179,191,196,197,227,233,238,239,251,257,263,266,269,281,
%U A082406 293,311,317,322,347,353,359,383,389,401,419,431,443,449,461,467,479
%N A082406 Numbers k such that k divides Sum_{j=1..k} binomial(2j,j).
%H A082406 Vaclav Kotesovec, <a href="/A082406/b082406.txt">Table of n, a(n) for n = 1..4973</a>
%H A082406 Vaclav Kotesovec, <a href="/A082406/a082406.jpg">Plot of a(n)/(n*log(n)) for n = 2..10000</a>
%F A082406 Is a(n) asymptotic to c*n*log(n) with 2 < c < 2.3?
%t A082406 Select[Range[500],Divisible[Sum[Binomial[2k,k],{k,#}],#]&] (* _Harvey P. Dale_, Feb 16 2013 *)
%t A082406 A066796 = Accumulate[Table[Binomial[2*k, k], {k, 1, 1000}]]; Select[Range[Length[A066796]], Divisible[A066796[[#]], #] &] (* _Vaclav Kotesovec_, Feb 15 2019 *)
%Y A082406 Cf. A066796.
%K A082406 nonn
%O A082406 1,2
%A A082406 _Benoit Cloitre_, Apr 23 2003