The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A267263 Number of nonzero digits in representation of n in primorial base. 27
 0, 1, 1, 2, 1, 2, 1, 2, 2, 3, 2, 3, 1, 2, 2, 3, 2, 3, 1, 2, 2, 3, 2, 3, 1, 2, 2, 3, 2, 3, 1, 2, 2, 3, 2, 3, 2, 3, 3, 4, 3, 4, 2, 3, 3, 4, 3, 4, 2, 3, 3, 4, 3, 4, 2, 3, 3, 4, 3, 4, 1, 2, 2, 3, 2, 3, 2, 3, 3, 4, 3, 4, 2, 3, 3, 4, 3, 4, 2, 3, 3, 4, 3, 4, 2, 3, 3, 4, 3, 4, 1, 2 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,4 LINKS Cade Brown, Table of n, a(n) for n = 0..10000 FORMULA a(n) = A001221(A276086(n)). - Antti Karttunen, Aug 21 2016 EXAMPLE a(3) = 2 because 3 written in primorial base is 11 with 2 nonzero digits. MAPLE a:= proc(n) local m, p, r; m, p, r:= n, 2, 0;        while m>0 do r:= r+`if`(irem(m, p, 'm')>0, 1, 0);                     p:= nextprime(p)        od; r     end: seq(a(n), n=0..100);  # Alois P. Heinz, Jan 15 2016 MATHEMATICA Table[Length[IntegerDigits[n, MixedRadix@ Prime@ Reverse@ Range@ PrimePi@ n] /. 0 -> Nothing], {n, 0, 120}] (* Michael De Vlieger, Jan 12 2016, Version 10.2 *) f[n_] := Block[{a = {{0, n}}}, Do[AppendTo[a, {First@ #, Last@ #} &@ QuotientRemainder[a[[-1, -1]], Times @@ Prime@ Range[# - i]]], {i, 0, #}] &@ NestWhile[# + 1 &, 0, Times @@ Prime@ Range[# + 1] <= n &]; Rest[a][[All, 1]]]; Table[Count[f@ n, d_ /; d > 0], {n, 0, 73}] (* Michael De Vlieger, Aug 29 2016 *) PROG (PARI) cnz(n) = my(d = digits(n)); sum(k=1, #d, d[k]!=0); A049345(n, p=2) = if(n

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified March 31 16:43 EDT 2020. Contains 333151 sequences. (Running on oeis4.)