The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A245626 a(n)= 1 (respectively, a(n)= 3) if up to 2^n the number of A245622-terms is more (respectively, less) than the number of A245623-terms; or a(n)=0 if these numbers are equal. 2
 0, 0, 3, 3, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 COMMENTS Since 10^2,10^3,... appear earlier than 3*10^2,3*10^3,..., then it is natural to conjecture, that, beginning with n=4, a(n)=0 or 1. LINKS PROG (PARI) conv(n) = if (n==0, 0, if (n>0, 3, 1)); nbdv(v, d) = my(m=0); for(i=1, #v, if(v[i]==d, m++)); m; a(n) = {nb3 = 0; nb1 = 0; forprime (j=1, 2^n, v = digits(j); d3 = nbdv(v, 3); d1 = nbdv(v, 1); if (d3 > d1, nb3++); if (d1 > d3, nb1++); ); conv(nb3 - nb1); } \\ Michel Marcus, Aug 04 2014 CROSSREFS Cf. A245622, A245623. Sequence in context: A280810 A283386 A278385 * A307233 A233320 A163535 Adjacent sequences:  A245623 A245624 A245625 * A245627 A245628 A245629 KEYWORD nonn,base,more AUTHOR Vladimir Shevelev, Jul 27 2014 EXTENSIONS More terms from Peter J. C. Moses, Jul 27 2014 STATUS approved

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 January 22 15:58 EST 2022. Contains 350481 sequences. (Running on oeis4.)