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 A178307 #7 Jun 02 2025 02:58:15
%S A178307 3,3,2,3,3,2,3,4,2,3,3,4,2,3,3,2,3,2,4,4,2,3,3,5,2,3,4,2,4,2,2,3,4,2,
%T A178307 3,2,3,3,3,2,2,4,4,4,9,2,2,2,3,3,2,4,5,3,2,3,3,4,2,4,2,2,4,3,3,2,2,2,
%U A178307 3,2,4,4,2,2,3,4,2,2,4,3,3,4,5,3,5,2,2,2,6,4,4,2,4,2,2,9,2,2,2,2,3,2,3,3,3
%N A178307 Remove powers of 2 from A000069. Let b(n) be n-th term of the remaining sequence. Then a(n) is the least number m such that (b(n))^m is in A001969.
%C A178307 The sequence {b(n)} coincides with A075930. Conjecture. For every n>=1, a(n) does exist.
%C A178307 The sequence b(n) is A075930 (Positions of check bits in code in A075928); see comment in that sequence. [From _Jeremy Gardiner_, May 26 2010]
%F A178307 If k=b(n)=2^m*b(s), where b(s) is odd, then a(n)=a(s).
%Y A178307 Cf. A000069 A001969 A178253
%Y A178307 Cf. A075930. [From _Jeremy Gardiner_, May 26 2010]
%K A178307 nonn
%O A178307 1,1
%A A178307 _Vladimir Shevelev_, May 24 2010, May 25 2010
%E A178307 Edited by _N. J. A. Sloane_, May 29 2010
%E A178307 Extended by _Jeremy Gardiner_, May 26 2010