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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A262512 Sequence gives the unique x for each term of A262511 which contains those numbers n that have exactly one solution to x - d(x) = n, where d(n) is the number of divisors of n (A000005). 5
 6, 5, 8, 7, 11, 14, 18, 20, 17, 24, 22, 23, 27, 32, 34, 35, 40, 43, 46, 50, 47, 51, 57, 58, 61, 72, 65, 73, 84, 77, 81, 79, 88, 86, 87, 96, 92, 93, 94, 98, 99, 102, 97, 105, 101, 103, 120, 107, 114, 116, 119, 123, 125, 130, 135, 137, 143, 154, 160, 151, 155, 158, 164, 163, 175, 173, 177, 184, 179, 187, 198, 200, 191, 194, 193, 204, 210, 197, 203, 216, 206, 209, 212 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Sequence is sorted by the magnitude of terms in A262511. Cf. also A262513. LINKS Antti Karttunen, Table of n, a(n) for n = 1..10000 FORMULA a(n) = the least (and the only) such number k > A262511(n) that A049820(k) = A262511(n). a(n) = A082284(A262511(n)). a(n) = A262686(A262511(n)). PROG (Scheme) (define (A262512 n) (let ((s (A262511 n))) (let loop ((k s)) (if (= s (A049820 k)) k (loop (+ 1 k)))))) CROSSREFS Cf. A000005, A049820, A082284, A262511, A262686. Cf. A262513 (same sequence sorted into ascending order). Sequence in context: A339253 A335165 A080799 * A348909 A272696 A048236 Adjacent sequences:  A262509 A262510 A262511 * A262513 A262514 A262515 KEYWORD nonn AUTHOR Antti Karttunen, Sep 25 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 7 14:56 EDT 2022. Contains 355989 sequences. (Running on oeis4.)