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 A334375 #10 Apr 27 2020 20:38:47 %S A334375 2,7,3,7,5,7,7,37,19,13,19,19,17,13,19,19,13,11,67,23,19,37,19,19,29, %T A334375 19,19,37,37,31,19,67,37,47,37,31,37,73,43,37,59,37,31,37,67,37,43,37, %U A334375 79,73,61,41,43,37,89,73,67,47,37,61,53,37,337,127,113,109 %N A334375 a(n) equals the n-th Moran number (A001101) divided by its sum of digits. %H A334375 Rémy Sigrist, <a href="/A334375/b334375.txt">Table of n, a(n) for n = 1..10000</a> %F A334375 a(n) = A001101(n) / A007953(A001101(n)). %e A334375 For n = 42: %e A334375 - A001101(42) = 555, %e A334375 - A007953(555) = 15, %e A334375 - hence a(42) = 555/15 = 37. %o A334375 (PARI) for (n=1, 1090, if (n%(s=sumdigits(n))==0 && isprime(n/s), print1 (n/s", "))) %Y A334375 Cf. A001101, A007953, A113315. %K A334375 nonn,look,base %O A334375 1,1 %A A334375 _Rémy Sigrist_, Apr 25 2020