|
%I #22 Jan 09 2024 10:30:28
%S 2,2,4,5,6,3,6,12,16,14,11,15,8,4,8,23,16,14,16,21,9,17,20,14,30,27,
%T 16,15,10,5,10,29,48,14,46,19,18,15,32,36,27,36,18,12,56,41,37,24,58,
%U 22,26,46,58,40,29,24,36,14,20,18,12,6,12,60,62,50,49,50,20,35,36,55,61,52,53,77
%N The smallest positive number such that 2^a(n) when written in base n contains adjacent equal digits.
%C In the first 10000 terms the largest value is a(9031) = 1924, with a corresponding power of 2 of approximately 1.52*10^579.
%H Scott R. Shannon, <a href="/A368866/b368866.txt">Table of n, a(n) for n = 2..10000</a>
%e a(2) = 2 as 2^2 = 4 written in base 2 = 100_2 which contains adjacent 0's.
%e a(6) = 6 as 2^6 = 64 written in base 6 = 144_6 which contains adjacent 4's.
%e a(10) = 16 as 2^16 = 65536 written in base 10 = 65536_10 which contains adjacent 5's.
%p f:= proc(n) local k,L;
%p for k from 1 do
%p L:= convert(2^k,base,n);
%p if member(0, L[2..-1]-L[1..-2]) then return k fi
%p od
%p end proc:
%p map(f, [$2..100]); # _Robert Israel_, Jan 09 2024
%o (Python)
%o from itertools import count
%o from sympy.ntheory.factor_ import digits
%o def A368866(n):
%o k = 1
%o for m in count(1):
%o k <<= 1
%o s = digits(k,n)[1:]
%o if any(s[i]==s[i+1] for i in range(len(s)-1)):
%o return m # _Chai Wah Wu_, Jan 08 2024
%Y Cf. A000079, A171901, A011557, A004642, A004643, A000866.
%K nonn,base
%O 2,1
%A _Scott R. Shannon_, Jan 08 2024
|
