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 A260430 #6 Jul 27 2015 22:14:13 %S A260430 1,4,12,2,30,7,6,74,19,21,18,3,172,52,54,49,48,11,9,383,10,128,125,32, %T A260430 36,132,31,119,118,5,27,24,812,314,89,25,283,92,275,76,86,85,83,290, %U A260430 75,267,266,17,16,68,60,14,724,15,227,1675,219,659,207,51,64,599,216,61,232,583,174,50,204,210,201,193,208,8,45,40,1574,612,173,569,595,159,43 %N A260430 Involution of natural numbers: a(1) = 1, a(A257803(1+n)) = A257804(a(n)), a(A257804(n)) = A257803(1+a(n)), where A257803 and A257804 give the positions of odd and even terms in A233271, the infinite trunk of inverted binary beanstalk. %H A260430 Antti Karttunen, <a href="/A260430/b260430.txt">Table of n, a(n) for n = 1..4453</a> %H A260430 <a href="/index/Per#IntegerPermutation">Index entries for sequences that are permutations of the natural numbers</a> %F A260430 a(1) = 1; for n > 1, if A257800(n) = 0 [when n is one of the terms of A257804] a(n) = A257803(1+a(A257808(n))), otherwise [when n is one of the terms of A257803] a(n) = A257804(a(A257807(n)-1)). %o A260430 (Scheme, with memoizing macro definec) %o A260430 (definec (A260430 n) (cond ((<= n 1) n) ((zero? (A257800 n)) (A257803 (+ 1 (A260430 (A257808 n))))) (else (A257804 (A260430 (+ -1 (A257807 n))))))) %Y A260430 Cf. A257800, A257803, A257804, A257807, A257808. %Y A260430 Cf. also A233271, A257806. %Y A260430 Related permutations: A260431 - A260434. %K A260430 nonn %O A260430 1,2 %A A260430 _Antti Karttunen_, Jul 27 2015