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 A178253 #9 May 13 2013 01:54:11 %S A178253 4,2,4,2,2,4,4,2,2,2,2,4,5,2,4,2,2,2,2,2,2,3,2,4,2,4,5,5,2,4,4,2,2,2, %T A178253 2,2,2,2,2,2,4,2,2,2,3,2,2,4,3,2,2,5,4,5,3,2,5,2,3,4,3,2,4,2,2,2,2,2, %U A178253 2,4,2,2,2,2,2,2,2,2,4,2,2,3,4,2,2,2,2,4,2,3,3,2,3,2,2,4,3,2,3,2,2,2,3,2,5 %N A178253 a(n) is the least positive integer m such that (A001969(n))^m is in A000069. %C A178253 Conjecture: a(n) exists for all n >= 2. %C A178253 The values of A001969(n)^m are given in A178373. [From _Jeremy Gardiner_, May 26 2010] %H A178253 Charles R Greathouse IV, <a href="/A178253/b178253.txt">Table of n, a(n) for n = 2..10000</a> %F A178253 If k=A001969(n)=2^m*A001969(s), where A001969(s) is odd, then a(n)=a(s). %o A178253 (PARI) a(n)=my(e=2*n--+hammingweight(n)%2,m=1); e>>=valuation(e,2); while(hammingweight(e^m++)%2==0,);m \\ _Charles R Greathouse IV_, Mar 22 2013 %Y A178253 Cf. A000069, A001969, A178373. %K A178253 nonn,easy %O A178253 2,1 %A A178253 _Vladimir Shevelev_, May 24 2010, May 25 2010 %E A178253 Extended by _Jeremy Gardiner_, May 26 2010 %E A178253 Edited by _N. J. A. Sloane_, Jun 08 2010