Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #12 Sep 04 2024 19:11:14
%S 3878,3879,3880,3881,3882,3883,3888,46656,50534,50535,50536,50537,
%T 50538,50539,50544
%N n is equal to the number of 2's in all numbers <= n written in base 6.
%t Module[{nn=51000,d2},d2=Accumulate[DigitCount[#,6,2]&/@Range[nn]];Select[ Thread[ {Range[ nn],d2}],#[[1]]==#[[2]]&]][[;;,1]] (* _Harvey P. Dale_, Sep 04 2024 *)
%Y Cf. A014778.
%K nonn,base,fini,full
%O 1,1
%A _Olivier Gérard_
%E List proved complete by _Hugo van der Sanden_ (cf. A014886).