|
%I #12 Jan 17 2021 11:10:38
%S 1,10,12,20,21,22,100,102,103,120,123,130,132,133,200,201,202,203,210,
%T 213,220,223,230,231,232,300,301,302,303,310,312,313,320,321,322,330,
%U 331,333,1000,1002,1003,1004,1020,1023,1024,1030,1032,1033,1034
%N Same as A038528, except you may rearrange the digits before applying f; sequence gives n such that f(f(f(...(n)))) = 0 or empty.
%H Sean A. Irvine, <a href="https://github.com/archmageirvine/joeis/blob/master/src/irvine/oeis/a038/A038527.java">Java program</a> (github)
%e 10->1,0->01->1(1 digit)->empty;
%e 200->2,0,0->020->20(2 digits)->0;
%e 302->3,0,2(3 digits)->0,2->20(2 digits)->0;
%e 517852555170->5,1,7,8,5,"2",5,5,5,"1",7,0(k=12)->(5,1,7,8,5,5,5,5,7,0),"12" ->5,"1",7,8,5,5,5,5,7,"0"(k=10)->(5,7,8,5,5,5,5,7),"10" ->5,7,"8",5,5,5,5,7(k=8)->(5,7,5,5,5,5,7),"8" ->5,"7",5,5,5,5,"7"(k=7)->(5,5,5,5,5),"7,7" ->"5,5,5,5,5"(k=5)->empty.
%Y Cf. A038528.
%K easy,nonn,base,nice
%O 1,2
%A _Naohiro Nomoto_
%E Offset corrected and missing a(23)=230 inserted by _Sean A. Irvine_, Jan 16 2021
|
