cp's OEIS Frontend

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.

Showing 1-2 of 2 results.

A229894 Expansion of q^2 * eta(q) / eta(q^49) in powers of q.

Original entry on oeis.org

1, -1, -1, 0, 0, 1, 0, 1, 0, 0, 0, 0, -1, 0, 0, -1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, -1, 0, 0, 0, 0, -1, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0, 0, 1, 0, 1, 1, 0, 0, 0, -1, 0, 0, -1, 0, 0, 0, 0, 0, -1, 1, 0, 0, 0, 1, 0, -1, 0, 0, 0, 0, 0
Offset: 0

Views

Author

Michael Somos, Oct 02 2013

Keywords

Examples

			G.f. = 1 - x - x^2 + x^5 + x^7 - x^12 - x^15 + x^22 + x^26 - x^35 + ...
G.f. = q^-2 - q^-1 - 1 + q^3 + q^5 - q^10 - q^13 + q^20 + q^24 - q^33 + ...
		

Crossrefs

Programs

  • Mathematica
    a[ n_] := SeriesCoefficient[ QPochhammer[ q] / QPochhammer[ q^49], {q, 0, n}];
  • PARI
    {a(n) = my(A); if( n<0, 0, A = x * O(x^n); polcoeff( eta(x + A) / eta(x^49 + A), n))};

Formula

Euler transform of period 49 sequence [ -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 0, ...].
Given g.f. A(x), then B(q) = q^-2*A(q) satisfies 0 = f(B(q), B(q^2), B(q^4)) where f(u, v, w) = u * v * w * (v^2 - 7) - (w - v) * (v - u) * (u*w - v^2).
G.f. is a period 1 Fourier series which satisfies f(-1 / (49 t)) = 7 g(t) where q = exp(2 Pi i t) and g() is the g.f. of A213598.
G.f.: Product_{k>0} (1 - x^k) / (1 - x^(49*k)).
Convolution inverse of A213598.
a(7*n + 3) = a(7*n + 4) = A(7*n + 6) = 0. a(7*n + 2) = 0 unless n=0.
a(7*n) = A108483(n).
a(n) = -(1/n)*Sum_{k=1..n} A287926(k)*a(n-k), a(0) = 1. - Seiichi Manyama, Jun 16 2017

A287926 Sum of the divisors of n that are not divisible by 49.

Original entry on oeis.org

1, 3, 4, 7, 6, 12, 8, 15, 13, 18, 12, 28, 14, 24, 24, 31, 18, 39, 20, 42, 32, 36, 24, 60, 31, 42, 40, 56, 30, 72, 32, 63, 48, 54, 48, 91, 38, 60, 56, 90, 42, 96, 44, 84, 78, 72, 48, 124, 8, 93, 72, 98, 54, 120, 72, 120, 80, 90, 60, 168, 62, 96, 104, 127, 84, 144
Offset: 1

Views

Author

Seiichi Manyama, Jun 15 2017

Keywords

Crossrefs

Sum of the divisors of n that are not divisible by k: A046913 (k=3), A046897 (k=4), A116073 (k=5), A284326 (k=6), A113957 (k=7), A284341 (k=8), A116607 (k=9), A284344 (k=10), A227131 (k=25), this sequence (k=49).

Programs

  • Mathematica
    f[p_, e_] := If[p == 7, 8, (p^(e+1)-1)/(p-1)]; a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 100] (* Amiram Eldar, Sep 17 2020 *)
  • PARI
    a(n)=sumdiv(n, d, ((d%49)>0)*d); \\ Andrew Howroyd, Jul 20 2018

Formula

Multiplicative with a(7^e) = 8 and a(p^e) = (p^(e+1)-1)/(p-1) otherwise. - Amiram Eldar, Sep 17 2020
Sum_{k=1..n} a(k) ~ (4*Pi^2/49) * n^2. - Amiram Eldar, Oct 04 2022

Extensions

Keyword:mult added by Andrew Howroyd, Jul 20 2018
Showing 1-2 of 2 results.