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 A333620 #6 Mar 29 2020 17:14:24
%S A333620 1,2,3,4,12,28,33,68,104,126,130,143,147,220,231,248,297,336,390,391,
%T A333620 408,416,429,442,518,575,741,752,779,812,825,1161,1170,1197,1295,1323,
%U A333620 1364,1440,1462,1566,1652,1677,1680,1692,1701,1720,1806,1817,1872,1909,2210
%N A333620 Numbers that are divisible by the total number of 1's in the dual Zeckendorf representations of all their divisors (A333618).
%e A333620 4 is a term since its divisors are {1, 2, 4}, their dual Zeckendorf representations (A104326) are {1, 10, 101}, and their sum of sums of digits is 1 + (1 + 0) + (1 + 0 + 1) = 4 which is a divisor of 4.
%t A333620 fibTerms[n_] := Module[{k = Ceiling[Log[GoldenRatio, n*Sqrt[5]]], t = n, fr = {}}, While[k > 1, If[t >= Fibonacci[k], AppendTo[fr, 1]; t = t - Fibonacci[k], AppendTo[fr, 0]]; k--]; fr];
%t A333620 dualZeckSum[n_] := Module[{v = fibTerms[n]}, nv = Length[v]; i = 1; While[i <= nv - 2, If[v[[i]] == 1 && v[[i + 1]] == 0 && v[[i + 2]] == 0, v[[i]] = 0; v[[i + 1]] = 1; v[[i + 2]] = 1; If[i > 2, i -= 3]]; i++]; i = Position[v, _?(# > 0 &)]; If[i == {}, 0, Total[v[[i[[1, 1]] ;; -1]]]]];
%t A333620 dualZeckDivDigSum[n_] := DivisorSum[n, dualZeckSum[#] &];
%t A333620 Select[Range[10^3], Divisible[#, dualZeckDivDigSum[#]] &]
%Y A333620 Cf. A093705, A104326, A112310, A328212, A333617, A333618, A333619.
%K A333620 nonn,base
%O A333620 1,2
%A A333620 _Amiram Eldar_, Mar 29 2020