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.
%I A119396 #16 Apr 04 2018 15:44:06 %S A119396 924,1104,1134,1540,1650,1760,1820,1908,1992,2016,2288,2556,2632,2744, %T A119396 2860,2940,2970,3000,3192,3204,3220,3248,3400,3630,3738,3784,3840, %U A119396 3852,3880,3968,3990,4134,4260,4410,4464,4674,4736,4860,4875,4930,4992,5016 %N A119396 Numbers n such that A086793(n)=20. %C A119396 Some trajectories are: 924,168,102,36,46,18,30,27,22,9,13,5,6,12,19,11,3,4,7,8,15 1104,168,102,... 1540,162,66,36,... 1650,162,66,36,... 2016,297,66,36,... 2940,297,66,36,... 3192,312,102,36,... All trajectories eventually join one of previous trajectories. %H A119396 Robert Israel, <a href="/A119396/b119396.txt">Table of n, a(n) for n = 1..10000</a> %e A119396 924 is a term because it reaches 15 in 20 steps with this trajectory 924,168,102,36,46,18,30,27,22,9,13,5,6,12,19,11,3,4,7,8,15. %p A119396 f:= proc(n) option remember; local t; %p A119396 if kernelopts(level) > 460 then return FAIL fi; %p A119396 t:= add(convert(convert(d,base,10),`+`),d=numtheory:-divisors(n)); %p A119396 1+procname(t) %p A119396 end proc: %p A119396 f(15):= 0: %p A119396 f(1):= FAIL: %p A119396 Res:= NULL: count:= 0: %p A119396 for n from 1 while count < 100 do %p A119396 if f(n) = 20 then %p A119396 count:= count+1; %p A119396 Res:= Res, n; %p A119396 fi %p A119396 od: %p A119396 Res; # _Robert Israel_, Apr 03 2018 %Y A119396 Cf. A034690, A086793, A094501, A095347, A114527, A118358, A119397, A119398, A260059. %K A119396 base,nonn %O A119396 1,1 %A A119396 _Zak Seidov_, May 17 2006 %E A119396 Edited by _Robert Israel_, Apr 03 2018