|
%I #6 May 13 2015 13:41:49
%S 1,1,1,1,1,1,1,1,1,1,2,1,3,3,3,3,3,3,3,3,3,3,1,4,3,4,4,4,4,4,3,3,4,1,
%T 4,4,4,4,4,4,3,3,3,4,1,4,4,4,4,4,3,3,4,4,4,1,4,4,4,4,3,3,4,4,4,4,1,4,
%U 4,4,3,3,4,4,4,4,4,1,4,4,3,3,4,4,4,4
%N Number of distinct values u^v, where u and v are digits occurring in decimal representation of n.
%C Row lengths in table A226272;
%C a(n) <= 61; A171102(1) = 1023456789 is the smallest number m such that a(m) = 61.
%C a(n) = 61 for almost all n, in the sense that the natural density of n such that a(n) < 61 is 0. - _Charles R Greathouse IV_, May 13 2015
%H Reinhard Zumkeller, <a href="/A226273/b226273.txt">Table of n, a(n) for n = 0..1000</a>
%e See A226272.
%o (Haskell)
%o a226273 = length . a226272_row :: Integer -> Int
%o (PARI) a(n)=if(n<9, return(1)); my(d=Set(digits(n)),v=List()); for(i=1,#d, for(j=1,#d, listput(v,d[i]^d[j]))); #Set(v) \\ _Charles R Greathouse IV_, May 13 2015
%K nonn,base
%O 0,11
%A _Reinhard Zumkeller_, Jul 09 2013
|
