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.

A265341 Permutation of odd numbers: a(n) = 1 + (2*A265353(n)).

This page as a plain text file.
%I A265341 #7 Dec 13 2015 07:50:40
%S A265341 1,3,7,5,9,21,13,19,25,11,15,39,17,27,63,49,57,75,31,23,67,37,55,61,
%T A265341 43,73,79,29,33,93,47,51,147,139,111,129,35,45,117,53,81,189,157,171,
%U A265341 225,103,69,201,145,165,183,151,219,237,85,65,193,41,71,211,121,199,205,91,59,175,109,163,169,115,181,187,97
%N A265341 Permutation of odd numbers: a(n) = 1 + (2*A265353(n)).
%H A265341 Antti Karttunen, <a href="/A265341/b265341.txt">Table of n, a(n) for n = 0..9841</a>
%F A265341 a(n) = 1 + (2*A265353(n)).
%o A265341 (Scheme) (define (A265341 n) (+ 1 (* 2 (A265353 n))))
%Y A265341 Topmost row of A265345.
%Y A265341 Cf. A265353.
%Y A265341 Cf. also A265342, A263273.
%K A265341 nonn
%O A265341 0,2
%A A265341 _Antti Karttunen_, Dec 07 2015