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 A117298 #6 Oct 31 2013 12:17:38
%S A117298 1,1,2,2,3,4,5,7,9,12,15,21,25,34,42,55,67,88,106,137,166,210,254,320,
%T A117298 384,478,575,708,848,1039,1239,1507,1795,2167,2574,3094,3661,4378,
%U A117298 5171,6153,7246,8591,10088,11914,13960,16424,19197,22519,26253,30701,35718
%N A117298 Number of partitions of n with unique smallest part and unique largest part.
%F A117298 a(2*n+1)= A002865(2*n+1)+1, a(2*n)= A002865(2*n).
%F A117298 a(n) = A117995(n)+1.
%t A117298 (* first do *) Needs["DiscreteMath`Combinatorica`"] (* then *) f[n_] := Block[{p = Partitions@n, q = PartitionsP@n, c = 0, k = 1}, While[k < q, s = Split@ p[[k]]; If[Length@First@s == 1 && Length@Last@s == 1, c++ ]; k++ ]; c]; Array[f, 51] (* _Robert G. Wilson v_ *)
%K A117298 easy,nonn
%O A117298 1,3
%A A117298 Emeric Deutsch and _Vladeta Jovovic_, Apr 23 2006
%E A117298 More terms from _Robert G. Wilson v_, Apr 25 2006