|
%I #12 May 12 2014 21:14:50
%S 1,2,1,2,2,2,1,2,2,2,3,2,2,2,3,2,2,2,3,2,3,2,2,2,2,2,2,2,3,2,1,3,3,3,
%T 3,2,2,3,2,2,2,3,2,2,3,3,3,3,2,2,3,2,2,2,3,2,3,3,3,2,3,2,3,3,3,3,2,2,
%U 3,2,2,2,3,2,4,2,2,4,2,2
%N Largest base in which n is pandigital.
%C The first occurrence of k in this sequence is given by A049363(k).
%H Reinhard Zumkeller, <a href="/A235708/b235708.txt">Table of n, a(n) for n = 1..10000</a>
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/PandigitalNumber.html">Pandigital Number</a>
%H Wikipedia, <a href="http://en.wikipedia.org/wiki/Pandigital_number">Pandigital number</a>
%o (Haskell)
%o import Data.List (unfoldr, nub); import Data.Tuple (swap)
%o a235708 n = f n where
%o f 1 = 1
%o f b = if isPandigital b n then b else f (b - 1) where
%o isPandigital b = (== b) . length . nub . unfoldr
%o (\x -> if x == 0 then Nothing else Just $ swap $ divMod x b)
%o -- _Reinhard Zumkeller_, May 12 2014
%Y Cf. A049363.
%K nonn,base,nice
%O 1,2
%A _Joonas Pohjonen_, May 02 2014
|
