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

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A338702 a(n) is the least k such that A060681(k) = n. 1
 1, 2, 3, 6, 5, 10, 7, 14, 16, 18, 11, 22, 13, 26, 21, 30, 17, 34, 19, 38, 25, 42, 23, 46, 48, 50, 39, 54, 29, 58, 31, 62, 64, 66, 51, 70, 37, 74, 57, 78, 41, 82, 43, 86, 55, 90, 47, 94, 96, 98, 75, 102, 53, 106, 81, 110, 112, 114, 59, 118, 61, 122, 93, 126 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 LINKS Rémy Sigrist, Table of n, a(n) for n = 0..10000 FORMULA a(n) <= 2*n for any n > 0. EXAMPLE The first terms of A060681 are: 0, 1, 2, 2, 4, 3, 6, 4, 6, 5, 10. So: a(0) = 1, a(1) = 2, a(2) = 3, a(4) = 5, a(3) = 6, a(6) = 7, a(10) = 11. PROG (PARI) A060681(n) = if (n==1, 0, my (d=divisors(n)); d[#d]-d[#d-1]) { u=0; a=vector(64, n, -1); for (k=1, oo, v=A060681(k); if (v<#a && a[1+v]<0, a[1+v]=k; while (a[1+u]>=0, print1 (a[u++]", "); if (u==#a, break (2))))) } CROSSREFS Cf. A060681. Sequence in context: A145110 A257405 A043547 * A064919 A064923 A064924 Adjacent sequences:  A338699 A338700 A338701 * A338703 A338704 A338705 KEYWORD nonn AUTHOR Rémy Sigrist, Apr 24 2021 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 December 3 15:15 EST 2021. Contains 349463 sequences. (Running on oeis4.)