|
%I #31 Jun 06 2020 16:34:38
%S 2,19,75,99,108,135,228,2102,8525,10535,13685,13710,26075,31835,44790,
%T 203367,247215,477543,518703,576495,620343,743823,3850399,6996535,
%U 6996871,6996920,7375543,8947631,11128712,12306056,78473956,89789620,156414388,222029284,306600196
%N Pandigitals in some base b (A061845) with an extra property: each number formed by the first i digits is divisible by i (digits in the pandigital base b) for 1 <= i <= b-1.
%C A111456 is the subsequence of terms divisible by the considered base (which is the least b such b^b > a(n)).
%C Is it true that there are no terms for base b > 16 and b even?
%H Hans Havermann and Giovanni Resta, <a href="/A256112/b256112.txt">Table of n, a(n) for n = 1..233</a> (first 163 terms from Chai Wah Wu)
%H Hans Havermann, <a href="http://chesswanks.com/num/a256112.pdf">base-formatted (a=10, b=11, c=12, ..) terms, A111456 highlighted</a>
%e 247215 = 2046513[7] (i.e., in base 7) is pandigital and 20[7] = 14 is even, 204[7] = 102 is divisible by 3, etc. up to 204651[7] = 35316 which is divisible by 6.
%e In contrast to A111456, the number as a whole does not need to be divisible by the considered base. - _M. F. Hasler_, May 27 2020
%o (Python)
%o def dgen(n,b):
%o if n == 1:
%o t = list(range(b))
%o for i in range(1,b):
%o u = list(t)
%o u.remove(i)
%o yield i, u
%o else:
%o for d, v in dgen(n-1,b):
%o for g in v:
%o k = d*b+g
%o if not k % n:
%o u = list(v)
%o u.remove(g)
%o yield k, u
%o A256112_list = lambda n: [a*k+b[0] for k in range(2, n) for a, b in dgen(k-1, k)]
%o print(A256112_list(10))
%Y Cf. A111456.
%K nonn,base
%O 1,1
%A _Chai Wah Wu_, Jun 07 2015
%E Edited by _M. F. Hasler_, May 27 2020
|
