cp's OEIS Frontend

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.

A245712 Permutation of natural numbers, odd bisection of A245706 incremented by one and halved: a(n) = (1+A245706((2*n)-1)) / 2.

This page as a plain text file.
%I A245712 #6 Aug 11 2014 22:23:06
%S A245712 1,2,3,6,4,14,5,38,10,8,26,330,18,46,283,42,11,34,7,50,70,22,17,326,
%T A245712 37,58,27,32,53,9590,554,4438,278,174,9,16,15,142,25,226,146,658,105,
%U A245712 310,1190,806,1770,524,51,5258,66,5302,35,518,17739,1054,19030,542,5550,8054,35498,4434,29,810,1106,72,75,28,63,166,83,150,44
%N A245712 Permutation of natural numbers, odd bisection of A245706 incremented by one and halved: a(n) = (1+A245706((2*n)-1)) / 2.
%H A245712 Antti Karttunen, <a href="/A245712/b245712.txt">Table of n, a(n) for n = 1..10001</a>
%H A245712 <a href="/index/Per#IntegerPermutation">Index entries for sequences that are permutations of the natural numbers</a>
%F A245712 a(n) = (1+A245706((2*n)-1)) / 2.
%o A245712 (PARI)
%o A245712 A245712(n) =(1+A245706((2*n)-1))/2;
%o A245712 for(n=1, 10001, write("b245712.txt", n, " ", A245712(n)));
%o A245712 \\ For the rest of code, see under A245706.
%o A245712 (Scheme) (define (A245712 n) (/ (+ 1 (A245706 (+ n n -1))) 2))
%Y A245712 Inverse: A245711.
%Y A245712 Cf. A245706, A245606.
%K A245712 nonn
%O A245712 1,2
%A A245712 _Antti Karttunen_, Jul 30 2014