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.

Previous Showing 31-35 of 35 results.

A219692 a(n) = Sum_{j=0..floor(n/3)} (-1)^j C(n,j) * C(2j,j) * C(2n-2j,n-j) * (C(2n-3j-1,n) + C(2n-3j,n)).

Original entry on oeis.org

2, 6, 54, 564, 6390, 76356, 948276, 12132504, 158984694, 2124923460, 28877309604, 398046897144, 5554209125556, 78328566695736, 1114923122685720, 15999482238880464, 231253045986317814, 3363838379489630916
Offset: 0

Views

Author

Jason Kimberley, Nov 25 2012

Keywords

Comments

This sequence is s_18 in Cooper's paper.
This is one of the Apery-like sequences - see Cross-references. - Hugo Pfoertner, Aug 06 2017
Every prime eventually divides some term of this sequence. - Amita Malik, Aug 20 2017

Crossrefs

The Apéry-like numbers [or Apéry-like sequences, Apery-like numbers, Apery-like sequences] include A000172, A000984, A002893, A002895, A005258, A005259, A005260, A006077, A036917, A063007, A081085, A093388, A125143 (apart from signs), A143003, A143007, A143413, A143414, A143415, A143583, A183204, A214262, A219692,A226535, A227216, A227454, A229111 (apart from signs), A260667, A260832, A262177, A264541, A264542, A279619, A290575, A290576. (The term "Apery-like" is not well-defined.)

Programs

  • Magma
    s_18 := func where C is Binomial;
    
  • Mathematica
    Table[Sum[(-1)^j*Binomial[n,j]*Binomial[2j,j]*Binomial[2n-2j, n-j]* (Binomial[2n-3j-1,n] +Binomial[2n-3j,n]), {j,0,Floor[n/3]}], {n,0,20}] (* G. C. Greubel, Oct 24 2017 *)
  • PARI
    {a(n) = sum(j=0,floor(n/3), (-1)^j*binomial(n,j)*binomial(2*j,j)* binomial(2*n-2*j,n-j)*(binomial(2*n-3*j-1,n) +binomial(2*n-3*j,n)))}; \\ G. C. Greubel, Apr 02 2019
    
  • Sage
    [sum((-1)^j*binomial(n,j)*binomial(2*j,j)*binomial(2*n-2*j,n-j)* (binomial(2*n-3*j-1,n)+binomial(2*n-3*j,n)) for j in (0..floor(n/3))) for n in (0..20)] # G. C. Greubel, Apr 02 2019

Formula

1/Pi
= 2*3^(-5/2) Sum {k>=0} (n a(n)/18^n) [Cooper, equation (42)]
= 2*3^(-5/2) Sum {k>=0} (n a(n)/A001027(n)).
G.f.: 1+hypergeom([1/8, 3/8],[1],256*x^3/(1-12*x)^2)^2/sqrt(1-12*x). - Mark van Hoeij, May 07 2013
Conjecture D-finite with recurrence: n^3*a(n) -2*(2*n-1)*(7*n^2-7*n+3)*a(n-1) +12*(4*n-5)*(n-1)* (4*n-3)*a(n-2)=0. - R. J. Mathar, Jun 14 2016
a(n) ~ 3 * 2^(4*n + 1/2) / (Pi^(3/2) * n^(3/2)). - Vaclav Kotesovec, Mar 08 2023

A260667 a(n) = (1/n^2) * Sum_{k=0..n-1} (2k+1)*S(k,n)^2, where S(k,x) denotes the polynomial Sum_{j=0..k} binomial(k,j)*binomial(x,j)*binomial(x+j,j).

Original entry on oeis.org

1, 37, 1737, 102501, 6979833, 523680739, 42129659113, 3572184623653, 315561396741609, 28807571694394593, 2701627814373536601, 259121323945378645947, 25330657454041707496017, 2516984276442279642274311, 253667099464270541534450025, 25884030861250181046253181349, 2670255662315910532447096232073
Offset: 1

Views

Author

Zhi-Wei Sun, Nov 14 2015

Keywords

Comments

Conjecture: For k = 0,1,2,... define S(k,x):= Sum_{j=0..k} binomial(k,j)*binomial(x,j)*binomial(x+j,j).
(i) For any integer n > 0, the polynomial (1/n^2) * Sum_{k=0..n-1}(2k+1)*S(k,x)^2 is integer-valued (and hence a(n) is always integral).
(ii) Let r be 0 or 1, and let x be any integer. Then, for any positive integers m and n, we have the congruence
Sum_{k=0..n-1} (-1)^(k*r)*(2k+1)*S(k,x)^(2m) == 0 (mod n).
(iii) For any odd prime p, we have Sum_{k=0..p-1} S(k,-1/2)^2 == (-1/p)(1-7*p^3*B_{p-3}) (mod p^4), where (a/p) is the Legendre symbol, and B_0,B_1,B_2,... are Bernoulli numbers. Also, for any prime p > 3 we have Sum_{k=0..p-1} S(k,-1/3)^2 == p - (14/3)*(p/3)*p^3*B_{p-2}(1/3) (mod p^4), where B_n(x) denotes the Bernoulli polynomial of degree n; Sum_{k=0..p-1} S(k,-1/4)^2 == (2/p)*p - 26*(-2/p)*p^3*E_{p-3} (mod p^4), where E_0,E_1,E_2,... are Euler numbers; Sum_{k=0..p-1} S(k,-1/6)^2 == (3/p)*p - (155/12)*(-1/p)*p^3*B_{p-2}(1/3) (mod p^4).
Our conjecture is motivated by a conjecture of Kimoto and Wakayama which states that Sum_{k=0..p-1} S(k,-1/2)^2 == (-1/p) (mod p^3) for any odd prime p. The Kimoto-Wakayama conjecture was confirmed by Long, Osburn and Swisher in 2014.
For more related conjectures, see Sun's paper arXiv.1512.00712. - Zhi-Wei Sun, Dec 03 2015

Examples

			a(2) = 37 since (1/2^2) * Sum_{k=0..1} (2k+1)*S(k,2)^2 = (S(0,2)^2 + 3*S(1,2)^2)/4 = (1^2 + 3*7^2)/4 = 148/4 = 37.
G.f. = x + 37*x^2 + 1737*x^3 + 102501*x^4 + 6979833*x^5 + 523680739*x^6 + ...
		

Crossrefs

The Apéry-like numbers [or Apéry-like sequences, Apery-like numbers, Apery-like sequences] include A000172, A000984, A002893, A002895, A005258, A005259, A005260, A006077, A036917, A063007, A081085, A093388, A125143 (apart from signs), A143003, A143007, A143413, A143414, A143415, A143583, A183204, A214262, A219692, A226535, A227216, A227454, A229111 (apart from signs), A260667, A260832, A262177, A264541, A264542, A279619, A290575, A290576. (The term "Apery-like" is not well-defined.)

Programs

  • Maple
    # Implementing Mark van Hoeij's formula.
    c := n -> binomial(2*n, n)/(n + 1):
    h := n -> simplify(hypergeom([-n,-n,-n], [1,-2*n], 1)):
    b := n -> c(n)^2*((n+11)*(2+4*n)^2*h(n+1)^2-2*(n+1)*(11*n+16)*(1+2*n)*h(n)*h(n+1)-h(n)^2*(n+1)^3)/(25*(n+2)):
    a := n -> b(n-1): seq(a(n), n = 1..17);  # Peter Luschny, Nov 11 2022
  • Mathematica
    S[k_,x_]:=S[k,x]=Sum[Binomial[k,j]Binomial[x,j]Binomial[x+j,j],{j,0,k}]
    a[n_]:=a[n]=Sum[(2k+1)*S[k,n]^2,{k,0,n-1}]/n^2
    Do[Print[n," ",a[n]],{n,1,17}]

Formula

a(n) ~ phi^(10*n + 3) / (10 * Pi^2 * n^3), where phi = A001622 is the golden ratio. - Vaclav Kotesovec, Nov 06 2021
Conjecture: a(p-1) == 1 (mod p^3) for all primes p >= 5. - Peter Bala, Aug 15 2022
a(n) = ((n+10)*A005258(n)^2 - (11*n+5)*A005258(n)*A005258(n-1) - n*A005258(n-1)^2)/(25*(n+1)). - Mark van Hoeij, Nov 11 2022

A262177 Decimal expansion of Q_5 = zeta(5) / (Sum_{k>=1} (-1)^(k+1) / (k^5 * binomial(2k, k))), a conjecturally irrational constant defined by an Apéry-like formula.

Original entry on oeis.org

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

Views

Author

Jean-François Alcover, Sep 14 2015

Keywords

Comments

The similar constant Q_3 = zeta(3) / (Sum_{k>=1} (-1)^(k+1) / (k^3 * binomial(2k, k))) evaluates to 5/2.

Examples

			2.09486862201003699385024929373294163029675874856778182740127587837438...
		

Crossrefs

Cf. A013663.
The Apéry-like numbers [or Apéry-like sequences, Apery-like numbers, Apery-like sequences] include A000172, A000984, A002893, A002895, A005258, A005259, A005260, A006077, A036917, A063007, A081085, A093388, A125143 (apart from signs), A143003, A143007, A143413, A143414, A143415, A143583, A183204, A214262, A219692, A226535, A227216, A227454, A229111 (apart from signs), A260667, A260832, A262177, A264541, A264542, A279619, A290575, A290576. (The term "Apery-like" is not well-defined.)

Programs

  • Mathematica
    Q5 = Zeta[5]/Sum[(-1)^(k+1)/(k^5*Binomial[2k, k]), {k, 1, Infinity}]; RealDigits[Q5, 10, 103] // First
  • PARI
    zeta(5)/suminf(k=1, (-1)^(k+1)/(k^5*binomial(2*k,k))) \\ Michel Marcus, Sep 14 2015

Formula

Equals 2*zeta(5)/6F5(1,1,1,1,1,1; 3/2,2,2,2,2; -1/4).

A111661 Expansion of eta(q)^4 * eta(q^2) * eta(q^6)^5 / eta(q^3)^4 in powers of q.

Original entry on oeis.org

1, -4, 1, 16, -24, -4, 50, -64, 1, 96, -120, 16, 170, -200, -24, 256, -288, -4, 362, -384, 50, 480, -528, -64, 601, -680, 1, 800, -840, 96, 962, -1024, -120, 1152, -1200, 16, 1370, -1448, 170, 1536, -1680, -200, 1850, -1920, -24, 2112, -2208, 256, 2451, -2404, -288, 2720, -2808, -4
Offset: 1

Views

Author

Michael Somos, Aug 08 2005

Keywords

Comments

Ramanujan theta functions: f(q) (see A121373), phi(q) (A000122), psi(q) (A010054), chi(q) (A000700).
Cubic AGM theta functions: a(q) (see A004016), b(q) (A005928), c(q) (A005882).

Examples

			G.f. = q - 4*q^2 + q^3 + 16*q^4 - 24*q^5 - 4*q^6 + 50*q^7 - 64*q^8 + q^9 + ...
		

References

  • B. C. Berndt, Ramanujan's Notebooks Part III, Springer-Verlag, see p. 226 Entry 4(i).

Programs

  • Mathematica
    a[ n_]:= If[ n < 1, 0, Sum[ Mod[ n/d, 2] d^2 KroneckerSymbol[d, 3], {d, Divisors[n]}]]; (* Michael Somos, Jul 09 2012 *)
    eta[q_]:= q^(1/24)*QPochhammer[q]; CoefficientList[Series[eta[q]^4* eta[q^2]*eta[q^6]^5/eta[q^3]^4, {q, 0, 30}], q] (* G. C. Greubel, Apr 18 2018 *)
  • PARI
    {a(n) = if( n<1, 0, sumdiv( n, d, (n/d%2) * d^2 * kronecker(d,3)) )};
    
  • PARI
    {a(n) = my(A); if( n<1, 0, n--; A = x * O(x^n); polcoeff( eta(x + A)^4 * eta(x^2 + A) * eta(x^6 + A)^5 / eta(x^3 + A)^4, n))};

Formula

Euler transform of period 6 sequence [-4, -5, 0, -5, -4, -6, ...].
Expansion of q * psi(q)^2 * phi(-q)^3 * psi(q^3)^2 / phi(-q^3) in powers of q where phi(), psi() are Ramanujan theta functions. - Michael Somos, Mar 01 2011
Expansion of (b(q^2)^3 - b(q)^3) / 9 in powers of q where b() is a cubic AGM theta function. - Michael Somos, Mar 01 2011
Expansion of (1/3) * b(q) * b(q^2) * c(q^2)^2 / c(q) in powers of q where b(), c() are cubic AGM theta functions. - Michael Somos, Jul 09 2012
a(n) is multiplicative with a(2^e) = (-4)^e, a(3^e) = 1, a(p^e) = ((p^2)^(e+1) - 1) / (p^2 - 1) if p == 1 (mod 6), a(p^e) = (1 - (-p^2)^(e+1)) / (p^2 + 1) if p == 5 (mod 6). - Michael Somos, Mar 01 2011
G.f. is a period 1 Fourier series which satisfies f(-1 / (6 t)) = 243^(1/2) (t/i)^3 g(t) where q = exp(2 Pi i t) and g() is the g.f. for A214262.
G.f.: Sum_{k>0} Kronecker(k, 3) * k^2 * x^k / (1 - x^(2*k)) = x * Product_{k>0} (1 - x^k)^4 * (1 - x^(2*k)) * (1 + x^(3*k))^5 * (1 - x^(3*k)).

A288143 Expansion of x * phi(x) * phi(x^3)^2 * f(x, x^5)^3 in powers of x where phi() is a Ramanujan theta function and f(, ) is Ramanujan's general theta function.

Original entry on oeis.org

1, 5, 9, 11, 24, 45, 50, 53, 81, 120, 120, 99, 170, 250, 216, 203, 288, 405, 362, 264, 450, 600, 528, 477, 601, 850, 729, 550, 840, 1080, 962, 821, 1080, 1440, 1200, 891, 1370, 1810, 1530, 1272, 1680, 2250, 1850, 1320, 1944, 2640, 2208, 1827, 2451, 3005, 2592
Offset: 1

Views

Author

Michael Somos, Jul 01 2017

Keywords

Comments

Ramanujan theta functions: f(q) (see A121373), phi(q) (A000122), psi(q) (A010054), chi(q) (A000700).
Cubic AGM theta functions: a(q) (see A004016), b(q) (A005928), c(q) (A005882).

Examples

			G.f. = q + 5*q^2 + 9*q^3 + 11*q^4 + 24*q^5 + 45*q^6 + 50*q^7 + 53*q^8 + 81*q^9 + ...
		

Crossrefs

Programs

  • Magma
    A := Basis( ModularForms( Gamma1(12), 3), 52); A[2] + 5*A[3] + 9*A[4] + 11*A[5] + 24*A[6] + 45*A[7] + 50*A[8] + 53*A[9] + 81*A[10] + 120*A[11] + 120*A[12] + 99*A[13];
  • Mathematica
    a[ n_] := If[ n < 1, 0, (-1)^n DivisorSum[ n, (-1)^# #^2 JacobiSymbol[ -3, n/#] &]];
    a[ n_] := SeriesCoefficient[ x EllipticTheta[ 3, 0, x] EllipticTheta[ 3, 0, x^3]^2 (QPochhammer[ -x, x^6] QPochhammer[ -x^5, x^6] QPochhammer[ x^6])^3, {x, 0, n}];
    a[ n_] := If[ n < 2, Boole[n == 1], Times @@ (Which[# == 3, 9^#2, # == 2, (4^(#2 + 1) + 9 (-1)^(#2 + 1))/5, Mod[#, 6] == 1, ((#^2)^(#2 + 1) - 1)/(#^2 - 1), True, ((#^2)^(#2 + 1) - (-1)^(#2 + 1))/(#^2 + 1)] & @@@ FactorInteger@n)];
  • PARI
    {a(n) = if( n<1, 0, (-1)^n * sumdiv( n, d, (-1)^d * d^2 * kronecker( -3, n/d)))};
    
  • PARI
    {a(n) = my(A); if( n<1, 0, n--; A = x * O(x^n); polcoeff( eta(x^2 + A)^11 * eta(x^6 + A)^7 / (eta(x + A)^5 * eta(x^3 + A) * eta(x^4 + A)^5 * eta(x^12 + A)), n))};
    
  • PARI
    {a(n) = my(A, p, e); if( n<1, 0, A = factor(n); prod(k=1, matsize(A)[1], [p, e] = A[k, ]; if( p==3, 9^e, p==2, (4^(e+1) + 9*(-1)^(e+1)) / 5, p%6==1, ((p^2)^(e+1) - 1) / (p^2 - 1), ((p^2)^(e+1) - (-1)^(e+1)) / (p^2 + 1))))};
    

Formula

Expansion of (a(q^2) - a(-q)) * (2*a(q) + a(-q))^2 / 54 in powers of q where a() is a cubic AGM theta function.
Expansion of -c(-q) * (2*c(q) + c(-q))^2 / 27 in powers of q where c() is a cubic AGM theta function.
Expansion of eta(q^2)^11 * eta(q^6)^7 / (eta(q)^5 * eta(q^3) * eta(q^4)^5 * eta(q^12)) in powers of q.
a(n) is multiplicative with a(3^e) = 9^e, a(2^e) = (4^(e+1) + 9*(-1)^(e+1)) / 5 if e>0, a(p^e) = ((p^2)^(e+1) - 1) / (p^2 - 1) if p == 1 (mod 6), a(p^e) = ((p^2)^(e+1) - (-1)^(e+1)) / (p^2 + 1) if p == 5 (mod 6).
Euler transform of period 12 sequence [5, -6, 6, -1, 5, -12, 5, -1, 6, -6, 5, -6, ...].
G.f. is a period 1 Fourier series which satisfies f(-1 / (12 t)) = 192^(1/2) (t/i)^3 g(t) where q = exp(2 Pi i t) and g() is the g.f. for A113261.
G.f.: Sum_{k>0} k^2 * x^k / (1 + x^k + x^(2*k)) * if(mod(k,4)=2, 3/2, 1).
a(n) = -(-1)^n * A214262(n).
Sum_{k=1..n} a(k) ~ c * n^3 / 3, where c = Product_{p prime == 1 (mod 6)} (p^3/(p^3-1)) * Product_{p prime == 5 (mod 6)} (p^3/(p^3+1)) = 1/(A334478 * A334479) = 0.99452678821883983883... . - Amiram Eldar, Feb 20 2024
Previous Showing 31-35 of 35 results.