The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A226632 Fewest odd numbers in a primitive cycle of positive integers under iteration by the 3x-k function, where k=A226630(n). 3
 1, 3, 4, 11, 12, 22, 8, 6, 4, 14, 8, 11, 11, 44, 5, 12, 14, 24, 7, 8, 5, 43, 28, 19, 6, 12, 43, 10, 14, 28, 15, 20, 53, 6, 11, 11, 20, 8, 43, 12, 6, 14, 10, 14, 54, 8, 10, 14, 14, 7, 10, 12, 28, 9, 43, 14, 7, 25, 11, 10, 35, 7, 36, 32, 24, 28, 17, 24 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS A cycle is called primitive if its elements are not a common multiple of the elements of another cycle. The 3x-k function T_k is defined by T_k(x) = x/2 if x is even, (3x-k)/2 if x is odd. LINKS Geoffrey H. Morley, Table of n, a(n) for n = 1..600 FORMULA a(n) = min_{j=A226628(n) to A226628(n+1)-1} A226626(j). CROSSREFS Sequence in context: A228236 A344346 A047457 * A098377 A075646 A133621 Adjacent sequences: A226629 A226630 A226631 * A226633 A226634 A226635 KEYWORD nonn AUTHOR Geoffrey H. Morley, Jun 14 2013 STATUS approved

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

Last modified June 9 13:19 EDT 2023. Contains 363180 sequences. (Running on oeis4.)