This site is supported by donations to The OEIS Foundation.

 Annual appeal: Please make a donation to keep the OEIS running! Over 6000 articles have referenced us, often saying "we discovered this result with the help of the OEIS". Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 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 1
 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, 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, 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 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS The sequence {b(n)} coincides with A075930. Conjecture. For every n>=1, a(n) does exist. 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] LINKS FORMULA If k=b(n)=2^m*b(s), where b(s) is odd, then a(n)=a(s). CROSSREFS Cf. A000069 A001969 A178253 Cf. A075930. [From Jeremy Gardiner, May 26 2010] Sequence in context: A060586 A076662 A164359 * A079063 A031352 A245885 Adjacent sequences:  A178304 A178305 A178306 * A178308 A178309 A178310 KEYWORD nonn AUTHOR Vladimir Shevelev, May 24 2010, May 25 2010 EXTENSIONS Edited by N. J. A. Sloane, May 29 2010 Extended by Jeremy Gardiner, May 26 2010 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified November 20 08:12 EST 2017. Contains 294962 sequences.