cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A292736 Numbers in which 6 outnumbers all other digits together.

This page as a plain text file.
%I A292736 #16 Sep 24 2017 16:06:12
%S A292736 6,66,166,266,366,466,566,606,616,626,636,646,656,660,661,662,663,664,
%T A292736 665,666,667,668,669,676,686,696,766,866,966,1666,2666,3666,4666,5666,
%U A292736 6066,6166,6266,6366,6466,6566,6606,6616,6626,6636,6646,6656,6660,6661,6662,6663,6664,6665,6666,6667,6668,6669,6676,6686
%N A292736 Numbers in which 6 outnumbers all other digits together.
%C A292736 Subset of A292456.
%H A292736 Robert Israel, <a href="/A292736/b292736.txt">Table of n, a(n) for n = 1..10000</a>
%e A292736 606 has more 6's than any other digit, whereas both 6006 and 6016 have as many other digits as 6's.
%p A292736 F:= proc(d) local s, m, T;
%p A292736   s:= 6*(10^d-1)/9;
%p A292736   T:= select(`>=`,{seq(seq(seq(s+G(c,k), k = 0 .. 10^m-1),c = combinat:-choose([$0..d-1],m)),m=0 .. floor((d-1)/2))},10^(d-1));
%p A292736   op(sort(convert(T,list)))
%p A292736 end proc:
%p A292736 G:= proc(c,k) local L,m,j;
%p A292736       m:= nops(c);
%p A292736       L:= convert(10^m+k,base,10);
%p A292736       add((L[j]-6)*10^c[j], j=1..m)
%p A292736 end proc:
%p A292736 seq(F(d),d=1..4); # _Robert Israel_, Sep 24 2017
%t A292736 Select[Range[0, 6700], Total@ #1 < First@ #2 & @@ TakeDrop[RotateLeft[#, 6] &@ DigitCount@ #, 9] &] (* _Michael De Vlieger_, Sep 22 2017 *)
%Y A292736 Cf. A292449, A292450, A292451, A292452, A292453, A292454, A292455, A292456, A292457, A292458, A292730, A292731, A292732, A292733, A292734, A292735, A292737, A292738, A292739.
%K A292736 nonn,base,look,easy
%O A292736 1,1
%A A292736 _Halfdan Skjerning_, Sep 22 2017