Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #11 Jul 15 2018 13:06:55
%S 0,0,0,1,0,1,1,0,2,0,0,2,0,0,0,0,0,1,1,0,0,0,0,0,0,0,0,0,0,4,0,0,0,1,
%T 0,0,0,0,0,0,1,1,0,0,0,0,0,0,0,0,1,0,0,0,1,1,0,0,0,2,0,0,0,0,0,0,0,0,
%U 0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,1,0,1,0,0,0,0,0,0,0,1,1,0,0
%N Define the divisor symmetry of a number n to be k if n-r and n+r have the same number of divisors for r = 1 to k but not for k+1. Sequence contains the divisor symmetry of n.
%C Subsidiary sequence: Index of the first occurrence of n in this sequence.
%C Is this sequence bounded? Through n = 20000, a(432)=6 is the only value greater than 4. - _Franklin T. Adams-Watters_, May 12 2006
%C I conjecture that the sequence is unbounded. [_Charles R Greathouse IV_, Dec 19 2011]
%H Charles R Greathouse IV, <a href="/A093492/b093492.txt">Table of n, a(n) for n = 1..10000</a>
%Y Cf. A202463, A093493, A093494, A093488, A093491.
%K nonn
%O 1,9
%A _Amarnath Murthy_, Apr 16 2004
%E More terms from _Franklin T. Adams-Watters_, May 12 2006