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 A277332 #15 Oct 29 2016 07:04:30 %S A277332 1,2,3,5,9,7,25,15,11,49,35,21,75,13,121,77,55,245,33,147,105,17,169, %T A277332 143,91,847,65,605,385,39,363,231,165,735,19,289,221,187,1859,119, %U A277332 1183,1001,85,845,715,455,4235,51,507,429,273,2541,195,1815,1155,23,361,323,247,3757,209,3179,2431,133,2023,1547,1309,13013,95 %N A277332 a(n) = A253565(A003714(n)). %C A277332 After the initial terms 1, 2 and 3, all other terms can be inductively generated by applying any finite composition-combination of A253560 and A253550 to 3, but with such a restriction that A253560 may not be applied twice in succession. %C A277332 A permutation of A277334. %C A277332 Note how A253565(A022340(n)) = A253565(2*A003714(n)) yields a permutation of A056911, odd squarefree numbers. %H A277332 Antti Karttunen, <a href="/A277332/b277332.txt">Table of n, a(n) for n = 0..10946</a> %F A277332 a(n) = A253565(A003714(n)). %e A277332 55 = A253550(A253550(A253560(A253550(3)))), 55 is in this sequence. %o A277332 (Scheme) (define (A277332 n) (A253565 (A003714 n))) %Y A277332 Cf. A003714, A022340, A253550, A253560, A253565. %Y A277332 Cf. A277334 (same sequence sorted into ascending order). %Y A277332 Cf. also A056911, A277006, A277331. %K A277332 nonn %O A277332 0,2 %A A277332 _Antti Karttunen_, Oct 12 2016