This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A269369 #10 Mar 06 2016 23:20:58 %S A269369 1,3,7,5,19,11,9,17,13,23,39,29,15,35,21,41,61,47,27,53,25,59,81,65, %T A269369 31,71,45,77,103,83,33,89,37,95,123,101,43,107,57,113,145,119,49,125, %U A269369 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 %N 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)). %C A269369 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. %C A269369 Permutation of odd numbers. %H A269369 Antti Karttunen, <a href="/A269369/b269369.txt">Table of n, a(n) for n = 1..25850</a> %F A269369 a(1) = 1; for n > 1, a(n) = A255551(A260438(n)+1, A260439(n)). %F A269369 Other identities. For all n >= 1: %F A269369 A269370(a(n)) = n. %o A269369 (Scheme) (define (A269369 n) (if (= 1 n) n (A255551bi (+ (A260438 n) 1) (A260439 n)))) ;; Code for A255551bi given in A255551. %Y A269369 Cf. A255551, A260438, A260439, A269372, A269375, A269377. %Y A269369 Cf. A269370 (left inverse). %Y A269369 Cf. also A250469, A269379. %K A269369 nonn %O A269369 1,2 %A A269369 _Antti Karttunen_, Mar 01 2016