|
%I #10 Oct 22 2014 12:29:44
%S 0,1,2,2,2,3,3,4,3,3,1,4,2,3,4,4,2,4,2,5,4,3,3,6,3,2,3,3,2,6,3,4,3,3,
%T 5,5,1,1,2,5,1,4,3,4,6,5,5,7,5,5,3,3,3,5,4,5,4,4,4,7,4,4,6,4,3,3,3,4,
%U 3,6,4,7,4,4,4,4,5,5,4,7,3,1,1,5,2,1,2,4,2,6,3,4,5,4,5,8,5,5,5,5,3,4,4,6,5
%N a(n) is the number of ways to write n in bases 2-10 such that the digit k-1 appears in the representation in base k.
%e a(11)=4 since 11 = 15 (base 6) = 23 (base 4) = 102 (base 3) = 1011 (base 2).
%o (PARI) a(n) = {nb = 0; for (b=2, 10, if (n, digs = digits(n, b), digs = [0]); for (i=1, #digs, if (digs[i] == b-1, nb++; break;););); return (nb);}\\ _Michel Marcus_, Jul 14 2013
%K nonn,base
%O 0,3
%A _Naohiro Nomoto_
%E Additional comments from Larry Reeves (larryr(AT)acm.org), Mar 16 2001
%E a(0) corrected by _Michel Marcus_, Jul 14 2013
|
