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.

A115853 Numbers where every digit that is present occurs more than once (not necessarily consecutively).

This page as a plain text file.
%I A115853 #11 Dec 13 2018 12:33:29
%S A115853 11,22,33,44,55,66,77,88,99,111,222,333,444,555,666,777,888,999,1001,
%T A115853 1010,1100,1111,1122,1133,1144,1155,1166,1177,1188,1199,1212,1221,
%U A115853 1313,1331,1414,1441,1515,1551,1616,1661,1717,1771,1818,1881,1919,1991,2002
%N A115853 Numbers where every digit that is present occurs more than once (not necessarily consecutively).
%C A115853 Through terms shown, this is also numbers where every digit present occurs the same number of times (not necessarily consecutively). The first number in this sequence not in that one is 10001.
%H A115853 Robert Israel, <a href="/A115853/b115853.txt">Table of n, a(n) for n = 1..10000</a>
%p A115853 filter:= proc(n)
%p A115853 local L,S;
%p A115853 L:= convert(n,base,10);
%p A115853 S:= convert(L,set);
%p A115853 min(seq(numboccur(i,L),i=S)) > 1
%p A115853 end proc:
%p A115853 select(filter, [$1..10000]); # _Robert Israel_, May 28 2014
%t A115853 edQ[n_]:=Min[Select[DigitCount[n],#!=0&]]>1; Select[Range[2100],edQ] (* _Harvey P. Dale_, Dec 13 2018 *)
%Y A115853 Cf. A033023, A014181.
%K A115853 base,nonn
%O A115853 1,1
%A A115853 _Franklin T. Adams-Watters_, Mar 13 2006