The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A338719 Define b(1)=1 and for n>1, b(n)=n/b(n-1); then a(n) = ceiling(b(n)). 2
 1, 2, 2, 3, 2, 4, 3, 4, 3, 5, 3, 5, 3, 5, 4, 6, 4, 6, 4, 6, 4, 6, 4, 7, 5, 7, 5, 7, 5, 7, 5, 8, 5, 8, 5, 8, 5, 8, 6, 8, 6, 9, 6, 9, 6, 9, 6, 9, 6, 9, 6, 10, 6, 10, 6, 10, 7, 10, 7, 10, 7, 10, 7, 11, 7, 11, 7, 11, 7, 11, 7, 11, 7, 11, 7, 11, 8, 12, 8, 12, 8, 12, 8, 12, 8, 12, 8 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS EXAMPLE The first few fractions b(n) are 1, 2, 3/2, 8/3, 15/8, 16/5, 35/16, 128/35, 315/128, 256/63, 693/256, 1024/231, 3003/1024, 2048/429, ... CROSSREFS Cf. A338718, A338720. For the numerators and denominators of b(n) see A004731 and A004730. Sequence in context: A280338 A339147 A062821 * A296080 A180633 A286610 Adjacent sequences:  A338716 A338717 A338718 * A338720 A338721 A338722 KEYWORD nonn AUTHOR N. J. A. Sloane, Nov 29 2020, following a suggestion from Anchar Koops, Nov 24 2020 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
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified June 18 14:54 EDT 2021. Contains 345119 sequences. (Running on oeis4.)