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 A386249 #12 Jul 21 2025 13:15:38
%S A386249 1,1,1,1,2,1,1,2,1,1,2,1,1,2,6,1,1,2,1,1,2,1,1,2,6,1,1,2,1,1,2,1,1,2,
%T A386249 6,1,14,1,2,15,1,1,2,1,1,2,6,1,1,2,1,1,2,1,1,2,6,1,1,2,1,14,1,2,1,15,
%U A386249 1,2,6,1,1,2,1,1,2,1,19,1,2,6,1,1,2,1,1,2
%N A386249 a(n) is the Hamming weight of A161792(n).
%C A386249 All terms appear infinitely many times: for any n > 0, A161792(n)*2^a(n) also belongs to A161792, say it equals A161792(m) for some m > n, so a(n) = a(m), and we can find as many other occurrences of a(n) as we want.
%H A386249 Michael S. Branicky, <a href="/A386249/b386249.txt">Table of n, a(n) for n = 1..275</a> (using b-file at A161792)
%F A386249 a(n) = A000120(A161792(n)).
%e A386249 a(35) = A000120(2985984) = 6.
%o A386249 (PARI) { for (n = 1, oo, if (ispower(n, h = hammingweight(n)), print1 (h", "));); }
%Y A386249 Cf. A000120, A161792, A325454, A386248.
%K A386249 nonn,base
%O A386249 1,5
%A A386249 _Rémy Sigrist_, Jul 16 2025
%E A386249 a(65) and beyond from _Michael S. Branicky_, Jul 21 2025 using A161792