|
%I #13 Dec 01 2023 17:35:37
%S 1,10,3,36,5,54,7,136,9,150,55,156,91,238,15,528,17,594,57,300,21,154,
%T 253,792,275,598,27,924,87,990,31,2080,33,2210,455,2124,333,1330,741,
%U 2600,1189,2394,215,308,45,1978,893,2160,931,550,51,2236,689,1134,495
%N a(n) = the smallest positive multiple, k, of n that when written in binary, and leading 0's of k are ignored, contains the reversal of the digits of binary n.
%C a(2n-1) = A161980(2n-1), for all n>=1.
%H John Tyler Rascoe, <a href="/A165790/b165790.txt">Table of n, a(n) for n = 1..8191</a>
%o (Python)
%o def A165790(n):
%o x = 1
%o while bin(n)[2:][::-1] not in bin(n*x): x += 1
%o return(n*x) # _John Tyler Rascoe_, Dec 01 2023
%Y Cf. A006995, A161980.
%K base,nonn
%O 1,2
%A _Leroy Quet_, Sep 26 2009
%E Extended by _Ray Chandler_, Mar 12 2010
|
