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-3 of 3 results.

A035175 Coefficients in expansion of Dirichlet series Product_p (1-(Kronecker(m,p)+1)*p^(-s)+Kronecker(m,p)*p^(-2s))^(-1) for m = -15.

Original entry on oeis.org

1, 2, 1, 3, 1, 2, 0, 4, 1, 2, 0, 3, 0, 0, 1, 5, 2, 2, 2, 3, 0, 0, 2, 4, 1, 0, 1, 0, 0, 2, 2, 6, 0, 4, 0, 3, 0, 4, 0, 4, 0, 0, 0, 0, 1, 4, 2, 5, 1, 2, 2, 0, 2, 2, 0, 0, 2, 0, 0, 3, 2, 4, 0, 7, 0, 0, 0, 6, 2, 0, 0, 4, 0, 0, 1, 6, 0, 0, 2, 5, 1, 0, 2, 0, 2, 0, 0, 0, 0, 2, 0, 6, 2, 4, 2, 6, 0, 2, 0, 3, 0, 4, 0, 0, 0
Offset: 1

Views

Author

Keywords

Comments

Coefficients of Dedekind zeta function for the quadratic number field of discriminant -15. See A002324 for formula and Maple code. - N. J. A. Sloane, Mar 22 2022

Examples

			q + 2*q^2 + q^3 + 3*q^4 + q^5 + 2*q^6 + 4*q^8 + q^9 + 2*q^10 +...
		

Crossrefs

Dedekind zeta functions for imaginary quadratic number fields of discriminants -3, -4, -7, -8, -11, -15, -19, -20 are A002324, A002654, A035182, A002325, A035179, A035175, A035171, A035170, respectively.
Dedekind zeta functions for real quadratic number fields of discriminants 5, 8, 12, 13, 17, 21, 24, 28, 29, 33, 37, 40 are A035187, A035185, A035194, A035195, A035199, A035203, A035188, A035210, A035211, A035215, A035219, A035192, respectively.

Programs

  • Mathematica
    QP = QPochhammer; s = (QP[q^3]*QP[q^5])^2/(QP[q]*QP[q^15])/q - 1/q + O[q]^105; CoefficientList[s, q] (* Jean-François Alcover, Nov 30 2015, adapted from PARI *)
    a[n_] := If[n < 0, 0, DivisorSum[n, KroneckerSymbol[-15, #] &]]; Table[a[n], {n, 1, 100}] (* G. C. Greubel, Jul 17 2018 *)
  • PARI
    m = -15; direuler(p=2,101,1/(1-(kronecker(m,p)*(X-X^2))-X))
    
  • PARI
    {a(n)=if(n<1, 0, sumdiv(n, d, kronecker(-15,d)))} \\ Michael Somos, Aug 25 2006
    
  • PARI
    {a(n)=local(A, p, e); if(n<1, 0, A=factor(n); prod(k=1, matsize(A)[1], if(p=A[k, 1], e=A[k, 2]; if(p==3||p==5, 1, if((p%15)!=2^valuation(p%15,2), (e+1)%2, (e+1))))))} \\ Michael Somos, Aug 25 2006
    
  • PARI
    {a(n)=if(n<1, 0, (qfrep([2, 1;1, 8],n, 1)+qfrep([4, 1;1, 4], n, 1))[n])} \\ Michael Somos, Aug 25 2006
    
  • PARI
    {a(n)=local(A); if(n<1, 0, A=x*O(x^n); polcoeff( eta(x^3+A)^2*eta(x^5+A)^2/eta(x+A)/eta(x^15+A), n))} \\ Michael Somos, Aug 25 2006

Formula

From Michael Somos, Aug 25 2006: (Start)
Expansion of -1 + (eta(q^3) * eta(q^5))^2 / (eta(q) * eta(q^15)) in powers of q.
Euler transform of period 15 sequence [ 1, 1, -1, 1, -1, -1, 1, 1, -1, -1, 1, -1, 1, 1, -2, ...]. if a(0)=1.
Moebius transform is period 15 sequence [ 1, 1, 0, 1, 0, 0, -1, 1, 0, 0, -1, 0, -1, -1, 0, ...].
Given g.f. A(x), then B(x) = 1 + A(x) satisfies 0 = f(B(x), B(x^2), B(x^4)) where f(u, v, w) = -v^3 + 4*u*v*w - 2*u*w^2 - u^2*w.
G.f.: -1 + x * Product_{k>0} ((1 - x^(3*k)) * (1 - x^(5*k)))^2 / ((1 - x^k) * (1 - x^(15*k))).
G.f.: -1 + (1/2) * (Sum_{n,m} x^(n^2 + n*m + 4*m^2) + x^(2*n^2 + n*m + 2*m^2)).
a(n) is multiplicative with a(3^e) = a(5^e) = 1, a(p^e) = (1+(-1)^e)/2 if p == 7, 11, 13, 14 (mod 15), a(p^e) = e+1 if p == 1, 2, 4, 8 (mod 15).
a(15*n + 7) = a(15*n + 11) = a(15*n + 13) = a(15*n + 14) = 0.
a(3*n) = a(n). a(n) = |A106406(n)| unless n=0. a(n) = A123864(n) unless n=0. (End)
Asymptotic mean: Limit_{m->oo} (1/m) * Sum_{k=1..m} a(k) = 2*Pi/sqrt(15) = 1.622311... . - Amiram Eldar, Oct 11 2022

A033455 Convolution of nonzero squares A000290 with themselves.

Original entry on oeis.org

1, 8, 34, 104, 259, 560, 1092, 1968, 3333, 5368, 8294, 12376, 17927, 25312, 34952, 47328, 62985, 82536, 106666, 136136, 171787, 214544, 265420, 325520, 396045, 478296, 573678, 683704, 809999, 954304, 1118480, 1304512, 1514513, 1750728, 2015538, 2311464
Offset: 1

Views

Author

Keywords

Comments

Total area of all square regions from an n X n grid. E.g., at n = 3, there are nine individual squares, four 2 X 2's and one 3 X 3, total area 9 + 16 + 9 = 34, hence a(3) = 34. - Jon Perry, Jul 29 2003
If X is an n-set and Y and Z disjoint 2-subsets of X then a(n) is equal to the number of 7-subsets of X intersecting both Y and Z. - Milan Janjic, Aug 26 2007
Every fourth term is odd. However, there are no primes in the sequence. - Zak Seidov, Feb 28 2011
-120*a(n) is the real part of (n + n*i)*(n + 2 + n*i)*(n + (n + 2)i)*(n + 2+(n + 2)*i)*(n + 1 + (n + 1)*i), where i = sqrt(-1). - Jon Perry, Feb 05 2014
The previous formula rephrases the factorization of the 5th-order polynomial a(n) = (n+1)*((n+1)^4-1) = (n+1)*A123864(n+1) based on the factorization in A123865. - R. J. Mathar, Feb 08 2014

Crossrefs

Programs

Formula

a(n-1) = n*(n^4 - 1)/30 = A061167(n)/30. - Henry Bottomley, Apr 18 2001
G.f.: x*(1+x)^2/(1-x)^6. - Philippe Deléham, Feb 21 2012
a(n) = Sum_{k=1..n+1} k^2*(n+1-k)^2. - Kolosov Petro, Feb 07 2019
E.g.f.: x*(30 +90*x +65*x^2 +15*x^3 +x^4)*exp(x)/30. - G. C. Greubel, Jul 05 2019

Extensions

More terms from Vincenzo Librandi, Mar 24 2014

A106406 Expansion of (eta(q) * eta(q^15))^2 / (eta(q^3) * eta(q^5)) in powers of q.

Original entry on oeis.org

1, -2, -1, 3, -1, 2, 0, -4, 1, 2, 0, -3, 0, 0, 1, 5, -2, -2, 2, -3, 0, 0, -2, 4, 1, 0, -1, 0, 0, -2, 2, -6, 0, 4, 0, 3, 0, -4, 0, 4, 0, 0, 0, 0, -1, 4, -2, -5, 1, -2, 2, 0, -2, 2, 0, 0, -2, 0, 0, 3, 2, -4, 0, 7, 0, 0, 0, -6, 2, 0, 0, -4, 0, 0, -1, 6, 0, 0, 2
Offset: 1

Views

Author

Michael Somos, May 02 2005

Keywords

Comments

Number 30 of the 74 eta-quotients listed in Table I of Martin (1996).

Examples

			G.f. = q - 2*q^2 - q^3 + 3*q^4 - q^5 + 2*q^6 - 4*q^8 + q^9 + 2*q^10 + ...
		

Crossrefs

Programs

  • Magma
    A := Basis( ModularForms( Gamma1(15), 1), 80); A[2] - 2*A[3] - A[4] + 3*A[5] - A[6] + 2*A[7]; /* Michael Somos, May 18 2015 */
  • Mathematica
    a[ n_] := SeriesCoefficient[ q (QPochhammer[ q] QPochhammer[ q^15])^2 / (QPochhammer[ q^3] QPochhammer[ q^5]), {q, 0, n}]; (* Michael Somos, May 18 2015 *)
    a[ n_] := If[ n < 1, 0, DivisorSum[ n, KroneckerSymbol[ #, 3] KroneckerSymbol[ n/#, 5] &]]; (* Michael Somos, May 18 2015 *)
  • PARI
    {a(n) = my(A); if( n<1, 0, n--; A = x * O(x^n); polcoeff( eta(x + A)^2 * eta(x^15 + A)^2 / (eta(x^3 + A) * eta(x^5 + A)), n))};
    
  • PARI
    {a(n) = if( n<1, 0, sumdiv( n, d, kronecker( d, 3) * kronecker( n/d, 5)))};
    
  • PARI
    {a(n) = my(A, p, e, x); if( n<1, 0, A = factor(n); prod( k=1, matsize(A)[1], [p, e] = A[k,]; if( p==3 || p==5, (-1)^e, (p%15) != 2^(x = valuation( p%15, 2)), (e+1)%2, (e+1) * (-1)^(x*e))))};
    
  • PARI
    {a(n) = if( n<1, 0, (qfrep([2, 1;1, 8],n, 1) - qfrep([4, 1;1, 4], n, 1))[n])}; /* Michael Somos, Aug 25 2006 */
    

Formula

Euler transform of period 15 sequence [-2, -2, -1, -2, -1, -1, -2, -2, -1, -1, -2, -1, -2, -2, -2, ...].
G.f. A(x) satisfies 0 = f(A(x), A(x^2), A(x^4)) where f(u, v, w) = -v^3 + 4 * u*v*w + 2 * u*w^2 + u^2*w.
a(n) is multiplicative with a(3^e) = a(5^e) = (-1)^e, a(p^e) = (1 + (-1)^e) / 2 if p == 7, 11, 13, 14 (mod 15), a(p^e) = e+1 if p == 1, 4 (mod 15), a(p^e) = (e+1) * (-1)^e if p == 2, 8 (mod 15). - Michael Somos, Oct 19 2005
G.f.: (1/2) * (Sum_{n,m in Z} x^(n^2 + n*m + 4*m^2) - x^(2*n^2 + n*m + 2 *m^2)). - Michael Somos, Aug 25 2006
G.f.: Sum_{k>0} Kronecker(k, 3) * x^k * (1 - x^k) * (1 - x^(2*k)) / (1 - x^(5*k)) = Sum_{k>0} Kronecker(k, 5) * x^k * (1 - x^k) / (1 - x^(3*k)).
G.f.: x * Product_{k>0} ((1 - x^k) * (1 - x^(15*k)))^2 / ((1 - x^(3*k)) * (1 - x^(5*k))).
a(15*n + 7) = a(15*n + 11) = a(15*n + 13) = a(15*n + 14) = 0. a(3*n) = a(5*n) = -a(n).
A035175(n) = |a(n)|. a(n)>0 iff n in A028957. a(n)<0 iff n in A028955.
G.f. is a period 1 Fourier series which satisfies f(-1 / (15 t)) = 15^(1/2) (t/i) f(t) where q = exp(2 Pi i t). - Michael Somos, May 18 2015
Showing 1-3 of 3 results.