cp's OEIS Frontend

A252757 Permutation of natural numbers: a(1)=1, and for n>1, if n is k-th number whose largest prime factor is less than the square of its smallest prime factor [i.e., n = A251726(k)], a(n) = 2*a(k), otherwise, when n = A251727(k), a(n) = 1 + 2*a(k).

%I A252757 #8 Jan 02 2015 22:17:03
%S A252757 1,2,4,8,16,32,64,128,256,3,512,6,1024,5,12,2048,10,24,4096,9,20,17,
%T A252757 48,8192,18,33,40,65,34,129,96,16384,257,513,36,66,80,7,1025,13,130,
%U A252757 2049,68,11,258,25,192,32768,514,4097,21,49,1026,72,132,8193,19,41,160,35,14,97,2050,26,260,16385,4098,37,67,81,136,22
%N A252757 Permutation of natural numbers: a(1)=1, and for n>1, if n is k-th number whose largest prime factor is less than the square of its smallest prime factor [i.e., n = A251726(k)], a(n) = 2*a(k), otherwise, when n = A251727(k), a(n) = 1 + 2*a(k).
%H A252757 Antti Karttunen, <a href="/A252757/b252757.txt">Table of n, a(n) for n = 1..10000</a>
%H A252757 <a href="/index/Per#IntegerPermutation">Index entries for sequences that are permutations of the natural numbers</a>
%F A252757 a(1)=1, and for n>1: if A252372(n) = 1 [i.e. the largest prime factor of n is less than the square of its smallest prime factor], a(n) = 2*a(A252373(k)), otherwise, a(n) = 1 + 2*a(n-A252373(n)-1).
%o A252757 (Scheme, with memoization-macro definec)
%o A252757 (definec (A252757 n) (cond ((<= n 1) n) ((= 1 (A252372 n)) (* 2 (A252757 (A252373 n)))) (else (+ 1 (* 2 (A252757 (- n (A252373 n) 1)))))))
%Y A252757 Inverse: A252758.
%Y A252757 Similar permutations: A243287, A135141, A237427.
%Y A252757 Cf. A252372, A252373, A251726, A251727.
%K A252757 nonn
%O A252757 1,2
%A A252757 _Antti Karttunen_, Jan 02 2015