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 A366386 #14 Oct 23 2023 15:17:13
%S A366386 0,0,0,1,0,1,1,2,2,1,0,2,1,2,2,3,1,3,2,2,2,1,2,3,3,2,4,3,1,3,0,4,2,2,
%T A366386 2,4,2,3,3,3,1,3,2,2,4,3,2,4,4,4,2,3,3,5,3,4,3,2,1,4,3,1,4,5,3,3,2,3,
%U A366386 4,3,2,5,2,3,5,4,2,4,1,4,6,2,2,4,2,3,3,3,3,5,3,4,2,3,3,5,3,5,4,5,2,3,4,4,4,4,3,6
%N A366386 Excess of n when n is factored into factors q(i) = prime(i)/i: a(n) = A196050(n) - A324923(n).
%H A366386 Antti Karttunen, <a href="/A366386/b366386.txt">Table of n, a(n) for n = 1..65537</a>
%H A366386 <a href="/index/Mat#matula">Index entries for sequences related to Matula-Goebel numbers</a>
%H A366386 <a href="/index/Pri#prime_indices">Index entries for sequences related to prime indices in the factorization of n</a>
%F A366386 a(n) = A196050(n) - A324923(n).
%F A366386 a(n) <= A358729(n).
%o A366386 (PARI)
%o A366386 A006530(n) = if(1==n, n, my(f=factor(n)); f[#f~, 1]);
%o A366386 A366386(n) = { my(lista = List([]), gpf, i); while(n > 1, gpf=A006530(n); i = primepi(gpf); n /= gpf; n *= i; listput(lista,i)); #lista - #Set(lista); };
%Y A366386 Cf. A006530, A196050, A324923.
%Y A366386 Cf. A007097 (positions of 0's), A358731 (of 1's).
%Y A366386 Cf. also A046660, A358729.
%K A366386 nonn
%O A366386 1,8
%A A366386 _Antti Karttunen_, Oct 23 2023