|
| |
|
|
A126806
|
|
Smallest number k such that 2^n divides A066796(k) = Sum(i=1,k,binomial(2*i,i)).
|
|
0
| |
|
|
1, 2, 2, 11, 11, 46, 46, 707, 707, 707, 2831, 2831, 11955, 11962, 45256, 45256
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,2
|
|
|
COMMENTS
| a(17)>75000. - Robert G. Wilson v (rgwv(AT)rgwv.com), Feb 25 2007
|
|
|
MATHEMATICA
| sb[1] = 2; sb[k_] := sb[k] = sb[k - 1] + Binomial[2k, k]; f[n_] := Block[{k = 1}, While[ Mod[sb@k, 2^n] != 0, k++ ]; k]; Do[Print@ f@n, {n, 0, 15}] - Robert G. Wilson v (rgwv(AT)rgwv.com), Feb 25 2007
|
|
|
CROSSREFS
| Cf. A066796.
Sequence in context: A037234 A141651 A090525 * A121871 A194638 A175202
Adjacent sequences: A126803 A126804 A126805 * A126807 A126808 A126809
|
|
|
KEYWORD
| more,nonn
|
|
|
AUTHOR
| Alexander Adamchuk (alex(AT)kolmogorov.com), Feb 23 2007
|
|
|
EXTENSIONS
| a(11)-a(16) from Robert G. Wilson v (rgwv(AT)rgwv.com), Feb 25 2007
|
| |
|
|
