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 A364123 #7 Jul 07 2023 05:42:18
%S A364123 2,4,6,8,9,12,14,16,20,22,24,27,30,36,38,40,42,44,48,54,56,57,60,65,
%T A364123 69,72,75,80,84,85,90,92,96,98,100,102,104,108,112,116,120,124,126,
%U A364123 132,136,138,145,147,150,153,155,159,160,175,180,185,190,195,196,205
%N A364123 Stolarsky-Niven numbers: numbers that are divisible by the number of 1's in their Stolarsky representation (A364121).
%C A364123 Numbers k such that A200649(k) | k.
%C A364123 Fibonacci(k) + 1 is a term if k !== 3 (mod 6) (i.e., k is in A047263).
%H A364123 Amiram Eldar, <a href="/A364123/b364123.txt">Table of n, a(n) for n = 1..10000</a>
%e A364123 4 is a term since its Stolarsky representation, A364121(4) = 10, has one 1 and 4 is divisible by 1.
%e A364123 6 is a term since its Stolarsky representation, A364121(6) = 101, has 2 1's and 6 is divisible by 2.
%t A364123 stol[n_] := stol[n] = If[n == 1, {}, If[n != Round[Round[n/GoldenRatio]*GoldenRatio], Join[stol[Floor[n/GoldenRatio^2] + 1], {0}], Join[stol[Round[n/GoldenRatio]], {1}]]];
%t A364123 stolNivQ[n_] := n > 1 && Divisible[n, Total[stol[n]]];
%t A364123 Select[Range[200], stolNivQ]
%o A364123 (PARI) stol(n) = {my(phi=quadgen(5)); if(n==1, [], if(n != round(round(n/phi)*phi), concat(stol(floor(n/phi^2) + 1), [0]), concat(stol(round(n/phi)), [1])));}
%o A364123 isA364123(n) = n > 1 && !(n % vecsum(stol(n)));
%Y A364123 Cf. A047263, A200649, A364121.
%Y A364123 Subsequences: A364124, A364125, A364126.
%Y A364123 Similar sequences: A005349, A049445, A064150, A064438, A064481, A118363, A328208, A328212, A331085, A333426, A342726, A334308, A331728, A342426, A344341, A351714, A351719, A352089, A352107, A352320, A352342, A352508.
%K A364123 nonn,base
%O A364123 1,1
%A A364123 _Amiram Eldar_, Jul 07 2023