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 A269379 #6 Mar 03 2016 22:50:38 %S A269379 1,3,5,9,7,15,11,21,19,27,13,33,17,39,35,45,23,51,31,57,49,63,25,69, %T A269379 29,75,65,81,37,87,55,93,79,99,59,105,41,111,95,117,43,123,47,129,109, %U A269379 135,53,141,85,147,125,153,61,159,73,165,139,171,103,177,67,183,155,189,113,195,71,201,169,207,77,213,101,219,185,225,83 %N A269379 a(1) = 1; for n > 1, a(n) = A255127(A260738(n)+1, A260739(n)). %C A269379 a(n) = the number located immediately below n in A255127 (square array generated by Ludic sieve) in the same column where n itself is, or in other words, the number removed in the next filtering stage at the same step as when n was removed in the A260738(n)-th stage. %C A269379 Permutation of odd numbers. %H A269379 Antti Karttunen, <a href="/A269379/b269379.txt">Table of n, a(n) for n = 1..32999</a> %F A269379 a(1) = 1; for n > 1, a(n) = A255127(A260738(n)+1, A260739(n)). %F A269379 Other identities. For all n >= 1: %F A269379 A269380(a(n)) = n. %o A269379 (Scheme) (define (A269379 n) (if (= 1 n) n (A255127bi (+ (A260738 n) 1) (A260739 n)))) ;; Code for A255127bi given in A255127. %Y A269379 Cf. A255127, A260738, A260739. %Y A269379 Cf. A269171, A269356, A269358, A269382, A269385, A269387 (sequences that use this function). %Y A269379 Cf. A269380 (left inverse). %Y A269379 Cf. also A250469, A269369. %K A269379 nonn %O A269379 1,2 %A A269379 _Antti Karttunen_, Mar 01 2016