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 A335968 #35 May 24 2021 00:08:36 %S A335968 3,11,83,583,9287,17088645,551906607361 %N A335968 Smallest number whose binary representation has exactly n 1 bits and for which the differences of pairs of positions of the 1 bits include all positive integers up to and including A005488(n). %C A335968 Verified by brute-force search. %C A335968 If A005488(9)=29, a(9)=690241543. %C A335968 If A005488(10)=37, a(10)=18590862013118808193. %C A335968 If A005488(11)=45, a(11)=2475880088154706432018350081. %C A335968 If A005488(12)=51, a(12)=11331575459480141. %H A335968 Mike Speciner, <a href="/A335968/a335968.txt">Python program for A335968</a> %e A335968 For n=2, a(2)=3=0b11. The bit positions of the 1's are 0 and 1, and their difference is 1; A005488(2)= 1. %e A335968 For n=3, a(3)=11=0b1011. The bit positions of the 1's are 0, 1, and 3, and we have 1=1-0, 2=3-1, and 3=3-0; A005488(3) = 3. %o A335968 (Python) # See Mike Speciner link %Y A335968 Cf. A005488. %K A335968 nonn,base,more %O A335968 2,1 %A A335968 _Mike Speciner_, Jul 02 2020