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 A067731 #6 Jun 24 2014 01:08:21 %S A067731 0,1,0,2,1,2,3,2,3,2,4,3,4,3,4,5,4,5,4,5,4,6,5,6,5,6,5,6,7,6,7,6,7,6, %T A067731 7,6,8,7,8,7,8,7,8,7,8,9,8,9,8,9,8,9,8,9,8,10,9,10,9,10,9,10,9,10,9, %U A067731 10,11,10,11,10,11,10,11,10,11,10,11,10,12,11,12,11,12,11,12,11,12,11 %N A067731 Maximum number of distinct parts in a self-conjugate partition of n, or 0 if n=2. %C A067731 There are no self-conjugate partitions of 2, so we set a(2)=0. %F A067731 a(n) = r - (s mod 2), where n = r(r+1)/2 + s with 0 <= s <= r; i.e. r = floor((sqrt(8n+1)-1)/2). %t A067731 r[n_] := Floor[(Sqrt[8n+1]-1)/2]; s[n_] := n-r[n](r[n]+1)/2; a[n_] := r[n]-Mod[s[n], 2] %Y A067731 Cf. A000700, A067694. %K A067731 easy,nonn %O A067731 0,4 %A A067731 _Naohiro Nomoto_, Feb 05 2002 %E A067731 Edited by _Dean Hickerson_, Feb 15 2002