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 A115859 #5 Mar 31 2012 13:21:10 %S A115859 0,0,0,0,0,0,3,0,0,0,7,0,5,6,0,0,0,0,15,0,13,14,19,0,9,10,15,12,21,0, %T A115859 27,0,0,0,31,0,29,30,35,0,25,26,27,28,0,38,27,0,17,18,0,20,45,30,51, %U A115859 24,25,42,55,0,45,54,59,0,0,0,63,0,61,62,67,0,57,58,71,60,69,70,63,0 %N A115859 Largest natural number m < n, such that there exists nonzero solutions to a cross-domain congruence m*i = n X i, zero if no such integer exists. %C A115859 Here * stands for ordinary multiplication and X means carryless (GF(2)[X]) multiplication (A048720). %H A115859 <a href="/index/Con#CongruCrossDomain">Index entries for sequences defined by congruent products between domains N and GF(2)[X]</a> %Y A115859 a(2n) = 2*a(n). Bisection A115860 gives the terms at odd positions. Differs from A115869 for the first time at n=23, where a(23)=19, while A115869(23)=15. Cf. A115857, A115861, A115871. %K A115859 nonn %O A115859 1,7 %A A115859 _Antti Karttunen_, Feb 07 2006