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 A275833 #14 Jun 24 2017 12:06:46 %S A275833 0,2,3,5,6,8,10,12,13,14,19,22,24,26,27,29,30,32,33,35,36,38,39,41,42, %T A275833 44,45,47,48,50,52,54,56,57,59,60,61,62,63,64,65,67,69,71,72,73,74,78, %U A275833 79,80,81,82,83,84,86,87,89,93,94,95,97,100,103,105,107,111,112,113,114,116,117,119,120,122,123,125,126,128,130,132,133,134,139,142,144 %N A275833 Positions of odd terms in A275832; indices of those permutations in tables A060117 & A060118 where element 1 is in an odd cycle. %C A275833 Indexing starts from zero, because a(0)=0 is a special case in this sequence. %C A275833 Equally: positions of odd terms in A275726. %H A275833 Antti Karttunen, <a href="/A275833/b275833.txt">Table of n, a(n) for n = 0..10000</a> %H A275833 Indranil Ghosh, <a href="/A275833/a275833.txt">Python program for computing this sequence</a> %H A275833 <a href="/index/Fa#facbase">Index entries for sequences related to factorial base representation</a> %o A275833 (Scheme, with _Antti Karttunen_'s IntSeq-library) %o A275833 (define A275833 (MATCHING-POS 0 0 (lambda (n) (odd? (A275832 n))))) %Y A275833 Complement: A275834. %Y A275833 Cf. A153880 (a subsequence). %Y A275833 Cf. A275726, A275832. %K A275833 nonn %O A275833 0,2 %A A275833 _Antti Karttunen_, Aug 11 2016