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 A235602 #22 Aug 05 2025 03:38:52
%S A235602 1,2,3,4,5,3,7,8,9,5,11,6,13,14,15,16,17,9,19,10,7,22,23,12,25,26,27,
%T A235602 28,29,30,31,32,33,17,35,18,37,38,39,20,41,14,43,44,45,46,47,24,49,50,
%U A235602 51,52,53,54,11,56,57,58,59,15,61,62,63,64,65,33,67,34,23,70,71,36,73,74,75,76,77,78,79,40,27,82
%N A235602 a(n) = n/wt(n) if wt(n) divides n, otherwise a(n) = n, where wt(n) is the binary weight of n (A000120).
%H A235602 Amiram Eldar, <a href="/A235602/b235602.txt">Table of n, a(n) for n = 1..10000</a>
%F A235602 From _Amiram Eldar_, Aug 04 2025: (Start)
%F A235602 a(n) = n if and only if n is in A065878 or A000079.
%F A235602 a(n) < n if and only if n is in A049445 but not in A000079. (End)
%t A235602 bw[n_]:=Module[{w=DigitCount[n,2,1]},If[Divisible[n,w],n/w,n]]; Array[ bw,90] (* _Harvey P. Dale_, Nov 06 2016 *)
%o A235602 (PARI) a(n) = my(s=hammingweight(n)); if (n % s, n, n/s); \\ _Michel Marcus_, Jul 15 2021
%Y A235602 Cf. A000079, A000120, A049445, A065878, A235600, A235601.
%K A235602 nonn,base,easy
%O A235602 1,2
%A A235602 _N. J. A. Sloane_, Jan 18 2014