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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A357589 a(n) = n - A130312(n). 0
 0, 1, 1, 2, 2, 3, 4, 3, 4, 5, 6, 7, 5, 6, 7, 8, 9, 10, 11, 12, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,4 LINKS Table of n, a(n) for n=1..70. FORMULA Conjecture: a(n) = 2*n - 1 - A183544(n). PROG (PARI) b1(n)=local(m); if(n<1, 0, m=0; until(fibonacci(m)>n, m++); m-2) \\ A072649 a(n)=n - fibonacci(b1(n)) (Python) from itertools import islice def A357589_gen(): # generator of terms a, b, i = 1, 1, 1 while True: yield from (j-a for j in range(i, i+a)) i += a a, b = b, a+b A357589_list = list(islice(A357589_gen(), 30)) # Chai Wah Wu, Oct 13 2022 CROSSREFS Cf. A130312, A183544. Sequence in context: A132919 A162619 A259196 * A336200 A032355 A308597 Adjacent sequences: A357586 A357587 A357588 * A357590 A357591 A357592 KEYWORD nonn,easy AUTHOR Mikhail Kurkov, Oct 05 2022 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 12 12:46 EDT 2024. Contains 375092 sequences. (Running on oeis4.)