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 A134345 #15 May 05 2016 06:23:46
%S A134345 1,1,1,2,2,3,4,5,6,7,9,11,13,16,19,23,27,32,38,44,52,61,71,82,95,109,
%T A134345 126,144,165,189,215,245,278,316,358,405,458,516,581,654,734,824,923,
%U A134345 1033,1155,1289,1438,1602,1783,1982,2202,2444,2710,3002,3323,3675,4061
%N A134345 Number of partitions of n into odd squarefree parts.
%C A134345 Also number of partitions into parts m such that 2*m is squarefree.
%H A134345 Alois P. Heinz, <a href="/A134345/b134345.txt">Table of n, a(n) for n = 0..10000</a>
%H A134345 Joerg Arndt, <a href="http://www.jjj.de/fxt/#fxtbook">Matters Computational (The Fxtbook)</a>, section 16.4.3 "Partitions into square-free parts", pp.351-352
%F A134345 G.f.: 1/prod(n>=1, 1 - moebius(2*n-1)^2 * x^(2*n-1)) = 1/prod(n>=1, 1 - moebius(2*n)^2 * x^(n)).
%o A134345 (PARI) N=75; x='x+O('x^N); Vec( 1/prod(n=1, N, 1-moebius(2*n-1)^2*x^(2*n-1) ) )
%K A134345 nonn
%O A134345 0,4
%A A134345 _Joerg Arndt_, Aug 27 2008