The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A316152 Inverse Euler transform of n^2. 4
1, 3, 5, 1, -6, -17, -4, 29, 56, 7, -158, -255, 56, 878, 1234, -725, -4966, -5852, 6132, 28410, 26932, -46529, -162814, -117479, 332350, 929292, 454328, -2279218, -5259270, -1252181, 15199212, 29375985, -1279006, -99212897, -161079712, 60433632, 635914664, 860993882 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
N. J. A. Sloane, Transforms
FORMULA
Product_{k>=1} (1-x^k)^(-a(k)) = 1 + Sum_{k>=1} A000290(k)*x^k.
G.f.: Sum_{k>=1} mu(k)*log(1 + x^k*(1 + x^k)/(1 - x^k)^3)/k. - Ilya Gutkovskiy, May 18 2019
EXAMPLE
(1-x)^(-1)*(1-x^2)^(-3)*(1-x^3)^(-5)*(1-x^4)^(-1)*(1-x^5)^6* ... = 1 + x + 4*x^2 + 9*x^3 + 16*x^4 + 25*x^5 + ... .
MAPLE
b:= proc(n, i) option remember; `if`(n=0, 1, `if`(i<1, 0,
add(binomial(a(i)+j-1, j)*b(n-i*j, i-1), j=0..n/i)))
end:
a:= proc(n) option remember; n^2-b(n, n-1) end:
seq(a(n), n=1..40); # Alois P. Heinz, Jun 29 2018
MATHEMATICA
b[n_, i_] := b[n, i] = If[n == 0, 1, If[i < 1, 0, Sum[Binomial[a[i] + j - 1, j]*b[n - i*j, i - 1], {j, 0, n/i}]]];
a[n_] := n^2 - b[n, n - 1];
a /@ Range[40] (* Jean-François Alcover, Jan 06 2020, after Alois P. Heinz *)
CROSSREFS
Sequence in context: A061649 A237603 A073365 * A302204 A065077 A118788
KEYWORD
sign
AUTHOR
Seiichi Manyama, Jun 25 2018
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 5 23:50 EDT 2024. Contains 373110 sequences. (Running on oeis4.)