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!)
 A269369 a(1) = 1, a(n) = A260439(n)-th number k for which A260438(k) = A260438(n)+1; a(n) = A255551(A260438(n)+1, A260439(n)). 9
 1, 3, 7, 5, 19, 11, 9, 17, 13, 23, 39, 29, 15, 35, 21, 41, 61, 47, 27, 53, 25, 59, 81, 65, 31, 71, 45, 77, 103, 83, 33, 89, 37, 95, 123, 101, 43, 107, 57, 113, 145, 119, 49, 125, 55, 131, 165, 137, 51, 143, 63, 149, 187, 155, 85, 161, 97, 167, 207, 173, 91, 179, 67, 185, 229, 191, 69, 197, 73, 203, 249, 209, 75 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS For n > 1, a(n) = the number located immediately below n in A255551 (square array generated by Lucky sieve) in the same column where n itself is. Permutation of odd numbers. LINKS Antti Karttunen, Table of n, a(n) for n = 1..25850 FORMULA a(1) = 1; for n > 1, a(n) = A255551(A260438(n)+1, A260439(n)). Other identities. For all n >= 1: A269370(a(n)) = n. PROG (Scheme) (define (A269369 n) (if (= 1 n) n (A255551bi (+ (A260438 n) 1) (A260439 n)))) ;; Code for A255551bi given in A255551. CROSSREFS Cf. A255551, A260438, A260439, A269372, A269375, A269377. Cf. A269370 (left inverse). Cf. also A250469, A269379. Sequence in context: A059912 A115765 A282598 * A305421 A112071 A231609 Adjacent sequences:  A269366 A269367 A269368 * A269370 A269371 A269372 KEYWORD nonn AUTHOR Antti Karttunen, Mar 01 2016 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 February 17 02:22 EST 2020. Contains 331976 sequences. (Running on oeis4.)