OEIS/Infinite Products: Difference between revisions

From tehowiki
Jump to navigation Jump to search
imported>Gfis
Transforms
MMA
 
(4 intermediate revisions by the same user not shown)
Line 29: Line 29:
# If we set f(n) = - n ([https://oeis.org/A001478 A001478]) and g(n) = n ([https://oeis.org/A000027 A000027]), we get A266964.
# If we set f(n) = - n ([https://oeis.org/A001478 A001478]) and g(n) = n ([https://oeis.org/A000027 A000027]), we get A266964.
# With the default f(n) = g(n) = [https://oeis.org/A000012 A000012] (all 1's), we get [https://oeis.org/A000041 A000041] (number of partitions of n).
# With the default f(n) = g(n) = [https://oeis.org/A000012 A000012] (all 1's), we get [https://oeis.org/A000041 A000041] (number of partitions of n).
=== Interesting sequences ===
 
* [https://oeis.org/A000081 A000081] Euler transform of itself, shifted by 1
=== RationalProductTransform ===
* <code>irvine.oeis.transform.[https://github.com/archmageirvine/joeis/blob/master/src/irvine/oeis/transform/RationalProductTransform.java RationalProductTransform]</code> superceedes <code>GeneralizedEulerTransform</code>
* general formula is <code>Product_{k&gt;0} 1/(1 - g(k)*x^h(k))^(f(k))</code>
* The class is constructed with the <code>Builder</code> pattern and a selecton from the following submethods:
f(final long val)
fl(final Function<Long, Long> lambda)
f(final Function<Integer, Z> lambda)
f(final Sequence seq)
f(final BiFunction<Integer, Z, Z> lambda2, final Sequence seq)
fq(final Function<Integer, Q> lambda)
fq(final RationalSequence seq)
fq(final BiFunction<Integer, Q, Q> lambda2, final RationalSequence seq)
g(final long val)
gl(final Function<Long, Long> lambda)
g(final Function<Integer, Z> lambda)
g(final Sequence seq)
g(final BiFunction<Integer, Z, Z> lambda2, final Sequence seq)
gq(final Function<Integer, Q> lambda)
gq(final RationalSequence seq)
gq(final BiFunction<Integer, Q, Q> lambda2, final RationalSequence seq)
h(final long val)
hl(final Function<Long, Long> lambda)
h(final Function<Integer, Z> lambda)
h(final Sequence seq)
h(final BiFunction<Integer, Z, Z> lambda2, final Sequence seq)
egf() // return an e.g.f. instead of an ordinary g.f.
prepend(final String preTerms) // prepend these to the resulting sequence
kMin(final int minK)
skip(final int skipNo) // skip so many terms of the resulting sequence
 
The callcode is '''<code>[https://github.com/gfis/joeis-lite/blob/master/internal/fischer/pattern/rpt.jpat rpt]</code>'''. Typical records for the generator<code>[https://github.com/gfis/joeis-lite/blob/master/internal/fischer/gen_seq4.pl gen_seq4.pl]</code>are:
A000586 rpt 0 f(-1).g(-1).h(new A000040())  Product_{k>=1} (1+x^prime(k)) partitions into distinct primes
A393989 rpt 0 f(-1).g(-1).h(k -> Z.valueOf(k*(k + 5L)/2)) Product_{k>=1} (1 + x^(k*(k+5)/2))
 
=== List of common products ===
Maple: <code>seq(coeff(series(mul((1-3*x^k), k = 1..n), x, n+1), x, n), n=0..15);</code>
 
Mathematica: [[oeis:A000700|A000700]] <code>CoefficientList[ Series[ Product[1 + x^(2k + 1), {k, 0, 75}], {x, 0, 70}], x]; also: 1/Product_{i>=1} (1 + (-x)^i)</code>
 
====(1+m*x^k)====
* [https://oeis.org/A000009 A000009] Product_{k>=1} (1+1*x^k)
* [https://oeis.org/A032302 A032302] Product_{k>=1} (1+2*x^k)
* [https://oeis.org/A032308 A032308] Product_{k>=1} (1+3*x^k)
* [https://oeis.org/A261568 A261568] Product_{k>=1} (1+4*x^k)
* [https://oeis.org/A261569 A261569] Product_{k>=1} (1+5*x^k)
 
* [https://oeis.org/A010815 A010815] Product_{k>=1} (1-1*x^k)
* [https://oeis.org/A000041 A000041] Product_{k>=1} (1-1*x^k)^(-1)
* [https://oeis.org/A070877 A070877] Product_{k>=1} (1-2*x^k)
* [https://oeis.org/A070933 A070933] Product_{k>=1} (1-2*x^k)^(-1)
* [https://oeis.org/A292128 A292128] Product_{k>=1} (1-3*x^k)
* [https://oeis.org/A242587 A242587] Product_{k>=1} (1-3*x^k)^(-1)
* [https://oeis.org/A246936 A246936] Product_{k>=1} (1-4*x^k)^(-1)
* [https://oeis.org/A246937 A246937] Product_{k>=1} (1-5*x^k)^(-1)
====(1+m*k*x^k)====
* [https://oeis.org/A265951 A006906] Product_{k>=1} (1-1*k*x^k)^(-1)
* [https://oeis.org/A265951 A265951] Product_{k>=1} (1-2*k*x^k)^(-1)
* [https://oeis.org/A265951 A265974] Product_{k>=1} (1-3*k*x^k)^(-1)
* [https://oeis.org/A265951 A265975] Product_{k>=1} (1-4*k*x^k)^(-1)
* [https://oeis.org/A265951 A265976] Product_{k>=1} (1-5*k*x^k)^(-1)
* [https://oeis.org/A032309 A022629] Product_{k>=1} (1+1*k*x^k)
* [https://oeis.org/A032309 A022693] Product_{k>=1} (1+1*k*x^k)^(-1)
* [https://oeis.org/A032309 A032309] Product_{k>=1} (1+2*k*x^k)

Latest revision as of 14:59, 9 March 2026

OEIS collection of transforms

weighout   b from a in 1+SUM b_n x^n = PI (1+x^n)^a_n
weighouti  a from b in 1+SUM b_n x^n = PI (1+x^n)^a_n
weighini   a from b in 1+SUM b_n x^n = PI (1+x^a_n)
weigh2out  b from a in 1+SUM b_n x^n = PI (x^-n+1+x^n)^a_n
weigh2outi a from b in 1+SUM b_n x^n = PI (x^-n+1+x^n)^a_n
weigh2in   b from a in 1+SUM b_n x^n = PI (x^-a_n+1+x^a_n)
weigh2ini  a from b in 1+SUM b_n x^n = PI (x^-a_n+1+x^a_n)

Programs

A046042 Number of partitions of n into fourth powers.

(Maple) 
g := -1 + 1/product(1 - x^(j^4), j=1..10): 
gser := series(g, x=0, 105): seq(coeff(gser, x, n), n=1..102);
(Maple, A303350)
seq(coeff(series(mul((1+4*x^k)^(1/2), k = 1..n), x, n+1), x, n), n=0..40);
(Mathematica) 
g = -1 + 1/Product[1 - x^(j^4), {j, 1, 10}]; 
gser = Series[g, {x, 0, 105}]; Table[Coefficient[gser, x, n], {n, 1, 102}]
(PARI, A322199)
{a(n) = polcoeff( 1/prod(m=1, n, 1 - (2^m+1)*x^m +x*O(x^n)), n)}
for(n=0, 30, print1(a(n), ","))

Generalized Euler transform

Product_{k>0} (1 - g(k)*x^k)^(- f(k)) = a(0) + a(1)*x + a(2)*x^2 + ...
  1. If we set g(n) = 1, we get the usual Euler transform.
  2. If we set f(n) = - h(n) and g(n) = -1, we get the weighout transform (cf. A026007).
  3. If we set f(n) = - n (A001478) and g(n) = n (A000027), we get A266964.
  4. With the default f(n) = g(n) = A000012 (all 1's), we get A000041 (number of partitions of n).

RationalProductTransform

  • irvine.oeis.transform.RationalProductTransform superceedes GeneralizedEulerTransform
  • general formula is Product_{k>0} 1/(1 - g(k)*x^h(k))^(f(k))
  • The class is constructed with the Builder pattern and a selecton from the following submethods:
f(final long val)
fl(final Function<Long, Long> lambda)
f(final Function<Integer, Z> lambda)
f(final Sequence seq)
f(final BiFunction<Integer, Z, Z> lambda2, final Sequence seq)
fq(final Function<Integer, Q> lambda)
fq(final RationalSequence seq)
fq(final BiFunction<Integer, Q, Q> lambda2, final RationalSequence seq)

g(final long val)
gl(final Function<Long, Long> lambda)
g(final Function<Integer, Z> lambda)
g(final Sequence seq)
g(final BiFunction<Integer, Z, Z> lambda2, final Sequence seq)
gq(final Function<Integer, Q> lambda)
gq(final RationalSequence seq)
gq(final BiFunction<Integer, Q, Q> lambda2, final RationalSequence seq)

h(final long val)
hl(final Function<Long, Long> lambda)
h(final Function<Integer, Z> lambda)
h(final Sequence seq)
h(final BiFunction<Integer, Z, Z> lambda2, final Sequence seq)

egf() // return an e.g.f. instead of an ordinary g.f.
prepend(final String preTerms) // prepend these to the resulting sequence
kMin(final int minK)
skip(final int skipNo) // skip so many terms of the resulting sequence

The callcode is rpt. Typical records for the generatorgen_seq4.plare:

A000586 rpt 0 f(-1).g(-1).h(new A000040())  Product_{k>=1} (1+x^prime(k)) partitions into distinct primes
A393989 rpt 0 f(-1).g(-1).h(k -> Z.valueOf(k*(k + 5L)/2)) Product_{k>=1} (1 + x^(k*(k+5)/2))

List of common products

Maple: seq(coeff(series(mul((1-3*x^k), k = 1..n), x, n+1), x, n), n=0..15);

Mathematica: A000700 CoefficientList[ Series[ Product[1 + x^(2k + 1), {k, 0, 75}], {x, 0, 70}], x]; also: 1/Product_{i>=1} (1 + (-x)^i)

(1+m*x^k)

  • A010815 Product_{k>=1} (1-1*x^k)
  • A000041 Product_{k>=1} (1-1*x^k)^(-1)
  • A070877 Product_{k>=1} (1-2*x^k)
  • A070933 Product_{k>=1} (1-2*x^k)^(-1)
  • A292128 Product_{k>=1} (1-3*x^k)
  • A242587 Product_{k>=1} (1-3*x^k)^(-1)
  • A246936 Product_{k>=1} (1-4*x^k)^(-1)
  • A246937 Product_{k>=1} (1-5*x^k)^(-1)

(1+m*k*x^k)

  • A006906 Product_{k>=1} (1-1*k*x^k)^(-1)
  • A265951 Product_{k>=1} (1-2*k*x^k)^(-1)
  • A265974 Product_{k>=1} (1-3*k*x^k)^(-1)
  • A265975 Product_{k>=1} (1-4*k*x^k)^(-1)
  • A265976 Product_{k>=1} (1-5*k*x^k)^(-1)
  • A022629 Product_{k>=1} (1+1*k*x^k)
  • A022693 Product_{k>=1} (1+1*k*x^k)^(-1)
  • A032309 Product_{k>=1} (1+2*k*x^k)