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 A335422 #7 Jun 09 2020 22:12:41 %S A335422 2,3,5,4,7,10,9,6,11,36,21,50,25,16,15,8,13,154,225,486,55,84,147,98, %T A335422 49,90,81,28,35,30,27,12,17,2500,429,8918,1225,1080,9375,840,91,2662, %U A335422 495,3750,605,220,363,1250,121,88,525,240,625,490,99,126,77,64,105,72,125,22,45,18,19,26950,21609,43350,1105,186340,67881 %N A335422 a(n) = A005940(1+A163511(n)). %C A335422 Permutation of natural numbers larger than one. %H A335422 Antti Karttunen, <a href="/A335422/b335422.txt">Table of n, a(n) for n = 0..16384</a> %H A335422 <a href="/index/Bi#binary">Index entries for sequences related to binary expansion of n</a> %F A335422 a(n) = A005940(1+A163511(n)). %F A335422 For all n >= 0, a(2^n) = A000040(2+n). %F A335422 A001222(a(n)) = A335420(n). %o A335422 (PARI) %o A335422 A005940(n) = { my(p=2, t=1); n--; until(!n\=2, if((n%2), (t*=p), p=nextprime(p+1))); t }; \\ From A005940 %o A335422 A054429(n) = ((3<<#binary(n\2))-n-1); \\ From A054429 %o A335422 A163511(n) = if(!n,1,A005940(1+A054429(n))) %o A335422 A335422(n) = A005940(1+A163511(n)); %Y A335422 Cf. A001222, A005940, A054429, A163511, A335420, A335421. %K A335422 nonn %O A335422 0,1 %A A335422 _Antti Karttunen_, Jun 09 2020