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 A211185 #17 May 13 2013 01:54:21 %S A211185 1,3,9,10,14,15,21,26,28,34,51,69,75,76,88,92,99,102,104,106,110,124, %T A211185 134,135,136,138,141,146,164,170,231,232,236,256,258,261,268,285,290, %U A211185 309,321,328,386,394,405,411,424,429,441,484,490,525,531,574,580,590,602,608,614,615,620,628,639,645,651,656,658 %N A211185 Numbers whose number of proper divisors equals the number of their anti-divisors. %C A211185 See A066272 for definition of anti-divisor. %C A211185 Numbers of divisors of n such that number of proper divisors of n equals the number of anti-divisors of n: 1, 2, 2, 3, 4, 4, 4, 4, 6, 4, 4, 4, 6, 6, 4, 4, 4, 12, 4, 6, 10, 4, 8, 8, 4, 12, 4, 6, 4, 12, 4, 4, 4,... %C A211185 Primes p such that number of proper divisors of p - 1 equals the number of anti-divisors of p - 1 and number of proper divisors of p + 1 equals the number of anti-divisors of p + 1 : 2, 103, 137, 257,... %C A211185 Numbers whose sum of proper divisors equals the sum of their anti-divisors: 1, 5, 41,... %H A211185 Charles R Greathouse IV, <a href="/A211185/b211185.txt">Table of n, a(n) for n = 1..10000</a> %F A211185 {n: A032741(n) = A066272(n)}. %e A211185 28 is here since it has 5 proper divisors {2, 4, 7, 14, 28} and 5 anti-divisors {3, 5, 8, 11, 19}. %p A211185 for n from 1 to 700 do %p A211185 if A032741(n) = A066272(n) then %p A211185 printf("%d,",n) ; %p A211185 end if; %p A211185 end do: # _R. J. Mathar_, Feb 03 2013 %o A211185 (PARI) is(n)=numdiv(2*n+1)+numdiv(2*n-1)+numdiv(n>>valuation(n, 2))-numdiv(n)==4 || n==1 \\ _Charles R Greathouse IV_, Feb 04 2013 %Y A211185 Cf. A000005, A032741, A066272, A073694, A178029. %K A211185 nonn %O A211185 1,2 %A A211185 _Juri-Stepan Gerasimov_, Feb 02 2013 %E A211185 Entries corrected by _R. J. Mathar_, Feb 03 2013