|
%I #24 Mar 20 2024 16:02:49
%S 1,2,11,11,15,66,66,96,96,96,96,96,3693,15005,18978,18978,18978,43002,
%T 55943,972190,1151214,2799146,15519397,15519397,15519397,122101417,
%U 210553237,289585489,473093534
%N Least integer k > 0 such that A000041(k) is divisible by 2^n.
%C The requirement a(n) > 0 is somewhat arbitrary, chosen for agreement with A046641; a(n) >= 0 would have been possible, too, yielding a(0)=0.
%C a(29) > 10^9.
%F a(n) = A046641(2^n).
%o (sh) i=1; c=1; while [ $c -le 21 ]; do echo -n `./A046641 $i`", "; c=`expr $c + 1`; i=`expr $i + $i`; done # _M. F. Hasler_, Oct 18 2008
%Y Cf. A000041, A046641, A000123, A046063.
%K more,nonn
%O 0,2
%A _M. F. Hasler_, Oct 12 2008
%E More terms from _M. F. Hasler_, Oct 18 2008
%E a(22)-a(28) from _Max Alekseyev_, Dec 16 2011
|
