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 A276951 #9 Sep 24 2016 10:49:27 %S A276951 0,1,1,2,3,4,1,5,2,6,7,8,3,9,4,10,11,12,13,14,15,16,17,18,1,19,5,20, %T A276951 21,22,2,23,6,24,25,26,7,27,8,28,29,30,31,32,33,34,35,36,3,37,9,38,39, %U A276951 40,4,41,10,42,43,44,11,45,12,46,47,48,49,50,51,52,53,54,13,55,14,56,57,58,15,59,16,60,61,62,17,63,18,64 %N A276951 Index of column where n is located in array A276953 (equally: row in A276955). %C A276951 a(0) = 0 by convention, because 0 is not present in arrays A276953 and A276955. %H A276951 Antti Karttunen, <a href="/A276951/b276951.txt">Table of n, a(n) for n = 0..5040</a> %H A276951 <a href="/index/Fa#facbase">Index entries for sequences related to factorial base representation</a> %F A276951 a(0) = 0; for n >= 1, if A260736(n) > 0 [when A276950(n) is not zero, when n is in A273670], then a(n) = A276952(n) = 1 + A273663(n), otherwise a(n) = a(A266193(n)). %F A276951 Other identities. For all n >= 0: %F A276951 a(n) = A257681(A275847(n)). %o A276951 (Scheme) (definec (A276951 n) (cond ((zero? n) n) ((not (zero? (A276950 n))) (A276952 n)) (else (A276951 (A266193 n))))) %Y A276951 Cf. A260736, A266193, A273670, A276950, A276952, A273663. %Y A276951 Cf. arrays A276953 & A276955. A276949 gives their other index. %Y A276951 Cf. also A257681, A275847. %K A276951 nonn,base %O A276951 0,4 %A A276951 _Antti Karttunen_, Sep 22 2016