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 A115847 #14 Jul 23 2017 00:00:43 %S A115847 0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,18,20,22,24,26,28,30,32,33, %T A115847 36,37,40,41,44,45,48,52,56,60,64,65,66,67,72,73,74,75,80,82,88,90,96, %U A115847 97,104,105,112,120,128,129,130,131,132,133,134,135,144,146,148,150 %N A115847 Integers i such that 17*i = 17 X i, i.e., 16*i XOR i = 17*i. %C A115847 Here * stands for ordinary multiplication and X means carryless (GF(2)[X]) multiplication (A048720). %C A115847 A116361(a(n)) <= 4. - _Reinhard Zumkeller_, Feb 04 2006 %H A115847 Charles R Greathouse IV, <a href="/A115847/b115847.txt">Table of n, a(n) for n = 0..10000</a> %H A115847 <a href="/index/Con#CongruCrossDomain">Index entries for sequences defined by congruent products between domains N and GF(2)[X]</a> %H A115847 <a href="/index/Con#CongruXOR">Index entries for sequences defined by congruent products under XOR</a> %o A115847 (PARI) is(n)=bitxor(n,16*n)==17*n \\ _Charles R Greathouse IV_, Dec 08 2013 %Y A115847 Cf. A115848 shows this sequence in binary. Complement of A115849. Differs from A032966 for the first time at n=25, where A032966(25)=34 while a(25)=33. %Y A115847 Cf. A003714, A048716, A115845, A116360. %K A115847 nonn %O A115847 0,3 %A A115847 _Antti Karttunen_, Feb 01 2006