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 A190585 #16 Jan 03 2021 14:07:45 %S A190585 1,1,1,1,-5,-29,-89,-209,-9239,-120455,-801359,-3674879,15450931, %T A190585 505760971,4925214295,30957618511,-3280733667119,-49063880680079, %U A190585 -327527326905119,-1087577476736255,97366167074820331,1723137650565888691,13360549076712501511 %N A190585 E.g.f. Product_{n>=1} (1 - x^n)^(-u(n)/n) where u(n) is the unitary Moebius function (A076479). %C A190585 The corresponding sequence for the (usual) Moebius function is the constant sequence a(n)=1 (A000012). %C A190585 Log(e.g.f.) = x - (1/4)*x^4 - (1/4)*x^8 - (1/9)*x^9 - (3/16)*x^16 - (1/25)*x^25 - (2/27)*x^27 - (1/8)*x^32 + (1/36)*x^36 - (1/49)*x^49 - (5/64)*x^64 +- ...; the corresponding function for the usual Moebius function is log(exp(x)) = x. %C A190585 Log(g.f.) = x + (1/2)*x^2 + (1/3)*x^3 - (23/4)*x^4 - (119/5)*x^5 - (359/6)*x^6 - (839/7)*x^7 +- ...; the corresponding function for the usual Moebius function if Sum_{n>=1} h(n)*x^n where h(n) = Sum_{k=1..n} 1/k is a harmonic number. %H A190585 Vincenzo Librandi, <a href="/A190585/b190585.txt">Table of n, a(n) for n = 0..65</a> %o A190585 (PARI) %o A190585 N=66; /* that many terms */ %o A190585 /* First compute the unitary Moebius function */ %o A190585 mu=vector(N); mu[1]=1; %o A190585 { for (n=2,N, %o A190585 s = 0; %o A190585 fordiv (n,d, %o A190585 if (gcd(d,n/d)!=1, next() ); /* unitary divisors only */ %o A190585 s += mu[d]; %o A190585 ); %o A190585 mu[n] = -s; %o A190585 ); }; %o A190585 egf=prod(n=1,N,(1-x^n)^(-mu[n]/n)); /* = 1 +x +1/2*x^2 +1/6*x^3 -5/24*x^4 +-... */ %o A190585 Vec(serlaplace(egf)) /* show terms */ %Y A190585 Cf. A076479. %K A190585 sign %O A190585 0,5 %A A190585 _Joerg Arndt_, May 13 2011