|
%I #26 Jun 22 2023 06:03:42
%S 1,3,3,15,15,47,95,95,287,335,1199,1199,1295,2015,2879,2879,2879,2879,
%T 2879,2879,2879,43199,211679,211679,211679,211679,211679,211679,
%U 211679,211679,3084479,3084479,3084479,3084479,3084479,3084479,302702399,469909439
%N The smallest integer m such that m mod 2k >= k for k = 1, 2, 3, ..., n.
%C Take the square array A(k, l) with k= 1, 2, ... and l = 0, 1, ... such that for each k, A(k, l) takes k zeros and then k ones alternately:
%C 0, 1, 0, 1, 0, 1, 0, 1, ...
%C 0, 0, 1, 1, 0, 0, 1, 1, ...
%C 0, 0, 0, 1, 1, 1, 0, 0, ...
%C ...
%C Then the a(n)-th column is the first column which begins with n ones.
%H Tomohiro Yamada, <a href="/A362531/a362531.py.txt">Fast Python program</a>, the original program written by nazratt2.
%e a(3) = 3 since 3 mod 2 = 1, 3 mod 4 = 3 >= 2, 3 mod 6 = 3 (but 3 mod 8 = 3 < 4) while 1 mod 4 = 1 < 2, 2 mod 2 = 0 < 1.
%o (PARI) a(n)={my(m);m=1;while(vecmin(vector(n,j,(m%(2*j))/j))<1,m=m+1);m}
%o (PARI) n=1;for(m=1,10^9,while(vecmin(vector(n,j,(m%(2*j))/j))>=1,print(n," ",m);n=n+1))
%o (Python)
%o def A362531(n):
%o m = 1
%o while True:
%o for k in range(n,0,-1):
%o if (l:=k-m%(k<<1))>0:
%o break
%o else:
%o return m
%o m += l # _Chai Wah Wu_, Jun 21 2023
%Y Cf. A053664.
%K nonn
%O 1,2
%A _Tomohiro Yamada_, Apr 24 2023
%E a(37)-a(38) from _Yifan Xie_, Apr 24 2023
|
