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 A249596 #18 Feb 24 2015 04:14:38 %S A249596 1,2,9,4,35,558,2205,8,135,137970,33,1068,545259,135926,138845925,16, %T A249596 527,2106,35288379945,2100,537075,8382,2093,4283544,1069975,130, %U A249596 2294286602622705,533820,133371,146557818382226310,585910928570692725,32,2079 %N A249596 Analog of A097717 in base 2. %C A249596 Conjecture: a(n) = n*A165781(n). - _R. J. Mathar_, Nov 11 2014 %H A249596 Lars Blomberg, <a href="/A249596/b249596.txt">Table of n, a(n) for n = 1..1661</a> %p A249596 A249596 := proc(n) %p A249596 local m,b,mbas,msf ; %p A249596 b := 2; %p A249596 for m from 1 to 1999999 do %p A249596 mbas := convert(m,base,b) ; %p A249596 msf := [op(-1,mbas),op(1..nops(mbas)-1,mbas)] ; %p A249596 msf := add(op(i,msf)*b^(i-1),i=1..nops(msf)) ; %p A249596 if m/n = msf then %p A249596 return m; %p A249596 end if; %p A249596 end do: %p A249596 -1 ; %p A249596 end proc: %p A249596 for n from 1 do %p A249596 print(n,A249596(n)) ; %p A249596 end do: # _R. J. Mathar_, Nov 11 2014 %Y A249596 Cf. A094676, A249597, A249598, A249599. %K A249596 nonn,base %O A249596 1,2 %A A249596 _R. J. Mathar_, Mar 30 2009 %E A249596 a(15)-a(33) from _Lars Blomberg_, Feb 05 2015