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 A245607 #13 Jul 31 2014 23:49:56 %S A245607 1,2,3,5,4,9,13,6,17,37,8,25,7,10,69,33,26,11,41,16,277,45,18,65,21, %T A245607 14,1109,15,52,73,57,74,35,209,82,293,141,34,53,329,12,1173,31,36,213, %U A245607 149,104,43,49,20,145,173,138,81,581,114,553,71,90,133,101,282,19,325,24,457,165,50,77,97,62,105,555,42 %N A245607 Permutation of natural numbers, the even bisection of A245605 halved: a(n) = A245605(2*n)/2. %H A245607 Antti Karttunen, <a href="/A245607/b245607.txt">Table of n, a(n) for n = 1..10001</a> %H A245607 <a href="/index/Per#IntegerPermutation">Index entries for sequences that are permutations of the natural numbers</a> %F A245607 a(n) = A245605(2*n)/2. %F A245607 As a composition of related permutations: %F A245607 a(n) = A245605(A064216(n)). %F A245607 a(n) = A245705(A245707(n)). %o A245607 (PARI) %o A245607 A064989(n) = my(f = factor(n)); for(i=1, #f~, if((2 == f[i,1]),f[i,1] = 1,f[i,1] = precprime(f[i,1]-1))); factorback(f); %o A245607 A245605(n) = if(1==n, 1, if(0==(n%2), 2*A245605(A064989(n-1)), 1+(2*A245605(A064989(n)-1)))); %o A245607 A245607(n) = A245605(2*n)/2; %o A245607 for(n=1, 10001, write("b245607.txt", n, " ", A245607(n))); %o A245607 (Scheme) (define (A245607 n) (A245605 (A064216 n))) %Y A245607 Inverse: A245608. %Y A245607 Cf. A064216, A064989, A245705, A245707, A245605, A245609-A245610, A245611, A244153, A243065-A243066. %K A245607 nonn %O A245607 1,2 %A A245607 _Antti Karttunen_, Jul 29 2014