Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Numbers n such that A047842(n) | n.
4

%I #19 Mar 08 2024 11:59:21

%S 0,22,777,4444,303300,333333,555555,588588,666666,888688,2032230,

%T 5055555,5858558,6568588,6868288,7339393,8282088,10213223,10311233,

%U 10313314,10313315,10313316,10313317,10313318,10313319,20002200,21322314,21322315,21322316,21322317,21322318

%N Numbers n such that A047842(n) | n.

%C Autobiographical numbers (A047841) are a subset of this sequence.

%C The first 3 terms which contain more than 9 copies of a digit are 666666666666, 898888888898 and 4444044404444. - _Giovanni Resta_, Feb 10 2014

%H Giovanni Resta, <a href="/A237605/b237605.txt">Table of n, a(n) for n = 1..1000</a> (first 101 terms from Paolo P. Lava)

%p P:=proc(q) local a,b,c,d,f,n,v; print(0); v:=array[0..9];

%p for n from 1 to q do a:=n; for b from 0 to 9 do v[b]:=0; od;

%p while a>0 do b:=a mod 10; v[b]:=v[b]+1; a:=trunc(a/10); od; a:=0;

%p for b from 0 to 9 do if v[b]>0 then c:=10*v[b]+b; f:=0; d:=c;

%p while d>0 do f:=f+1; d:=trunc(d/10); od; a:=a*10^f+c; fi; od;

%p if type(n/a,integer) then print(n); fi; od; end: P(10^10);

%t Select[Range[10^6], Mod[#, FromDigits@ Flatten[IntegerDigits /@ Flatten[ Reverse /@ Tally@ Sort@ IntegerDigits@#]]] == 0 &] (* _Giovanni Resta_, Feb 10 2014 *)

%Y Cf. A047841, A047842.

%K nonn,base,easy

%O 1,2

%A _Paolo P. Lava_, Feb 10 2014