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 A082562 #27 Feb 16 2016 08:42:17
%S A082562 1,2,4,8,15,24,35,48,63,80,99,120,143,168,195,224,255,288,323,360,399,
%T A082562 440,483,528,575,624,675,728,783,840,899,960,1023,1088,1155,1224,1295,
%U A082562 1368,1443,1520,1599,1680,1763,1848,1935,2024,2115,2208,2303,2400,2499
%N A082562 a(n) = number of values of m such that m can be expressed as the sum of distinct odd numbers with largest odd number in the sum = 2n+1.
%C A082562 Beginning with the third term, the first differences are the odd positive integers. - _John W. Layman_, Feb 28 2012
%H A082562 Colin Barker, <a href="/A082562/b082562.txt">Table of n, a(n) for n = 0..1000</a>
%H A082562 <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (3,-3,1).
%F A082562 For n>2, a(n) = n^2-1. The values of m are all values from 2n+1 to (n+1)^2 except 2n+3 and n^2+2n-1. - _David Wasserman_, Sep 16 2004
%F A082562 From _Colin Barker_, Feb 15 2016: (Start)
%F A082562 a(n) = n^2-1 for n>2.
%F A082562 a(n) = 3*a(n-1)-3*a(n-2)+a(n-3) for n>5.
%F A082562 G.f.: (1-x+x^2+x^3+x^4-x^5) / (1-x)^3.
%F A082562 (End)
%t A082562 Join[{1, 2, 4}, LinearRecurrence[{3, -3, 1}, {8, 15, 24}, 80]] (* and *) Join[{1, 2, 4}, Table[n^2 - 1, {n, 3, 80}]] (* _Vladimir Joseph Stephan Orlovsky_, Feb 13 2012 *)
%o A082562 (PARI) Vec((1-x+x^2+x^3+x^4-x^5)/(1-x)^3 + O(x^100)) \\ _Colin Barker_, Feb 15 2016
%Y A082562 Cf. A082548, A082547.
%K A082562 easy,nonn
%O A082562 0,2
%A A082562 _Naohiro Nomoto_, May 05 2003
%E A082562 More terms from _David Wasserman_, Sep 16 2004