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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A255338 Each n occurs A255337(n) times. 4
 0, 1, 2, 3, 4, 4, 5, 6, 7, 7, 8, 8, 9, 9, 10, 11, 12, 13, 13, 14, 14, 14, 15, 15, 16, 16, 17, 17, 18, 18, 19, 20, 21, 22, 22, 23, 23, 23, 24, 24, 25, 25, 25, 26, 26, 26, 27, 27, 28, 29, 29, 30, 30, 30, 31, 31, 32, 32, 33, 33, 34, 34, 35, 36, 37, 38, 38, 39, 39, 39, 40, 40, 41, 41, 41, 42, 42 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 LINKS Antti Karttunen, Table of n, a(n) for n = 0..8192 FORMULA a(n) = The least k such that A255057(k) >= n. PROG (Scheme, with Antti Karttunen's IntSeq-library) (define A255338 (LEAST-GTE-I 0 0 A255057)) CROSSREFS The first differences gives A255339, the characteristic function of A255057. Cf. A255337. Sequence in context: A268382 A107079 A025528 * A123580 A072894 A328309 Adjacent sequences:  A255335 A255336 A255337 * A255339 A255340 A255341 KEYWORD nonn AUTHOR Antti Karttunen, Feb 21 2015 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 August 13 16:07 EDT 2022. Contains 356107 sequences. (Running on oeis4.)