A086466 -id:A086466 - cp's OEIS frontend

A002390 Decimal expansion of natural logarithm of golden ratio.

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

Offset: 0

N. J. A. Sloane

The Baxa article proves that every gamma >= this constant is the Lévy constant of a transcendental number. - Michel Marcus, Apr 09 2016
The entropy of the golden mean shift. See Capobianco link. - Michel Marcus, Jan 19 2019
Also the limiting value of the area of the function y = 1/x bounded by the abscissa of consecutive F(n) points (where F(n)=A000045(n) are the Fibonacci numbers and n > 0). - Burak Muslu, May 09 2021

			0.481211825059603447497758913424368423135184334385660519661...

George Boros and Victor H. Moll, Irresistible integrals, Cambridge University Press (2006), p. 236.
W. E. Mansell, Tables of Natural and Common Logarithms. Royal Society Mathematical Tables, Vol. 8, Cambridge Univ. Press, 1964, p. XVIII.
B. Muslu, Sayılar ve Bağlantılar 2, Luna, 2021, pages 31-38.
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

G. C. Greubel, Table of n, a(n) for n = 0..5000
Alexander Adamchuk's comment, Sep 01 2006 Mathematics in Russian
Christoph Baxa, Lévy constants of transcendental numbers, Proc. Amer. Math. Soc. 137 (2009), 2243-2249.
Christopher Brown, The natural logarithm of the golden section, Fibonacci Quarterly 55:5 (2017), pp. 42-44.
Silvio Capobianco, Introduction to Symbolic Dynamics. Part 4: Entropy; The entropy of the golden mean shift, Institute of Cybernetics at TUT; May 12 2010. Slides 15-17.
Simon Plouffe, Plouffe's Inverter, ln(phi) to 10000 digits
Simon Plouffe, ln(0.5+0.5*SQRT(5)) to 2000 digits
Eric Weisstein's World of Mathematics, Fibonacci Hyperbolic Functions
Index entries for transcendental numbers

Cf. A000108, A001622, A013661, A086463, A086466, A263401.

Maple
```
arcsinh(1/2); evalf(%, 120);
```

RealDigits[N[Log[GoldenRatio],200]][[1]] (* Vladimir Joseph Stephan Orlovsky, Feb 20 2011 *)

asinh(1/2) \\ Charles R Greathouse IV, Jan 04 2016

Also equals arcsinh(1/2).
Equals sqrt(5)* A086466 /2. - Seiichi Kirikami, Aug 20 2011
Equals sqrt(5)*(5* A086465 -1)/4. - Jean-François Alcover, Apr 29 2013
Also equals (125*C - 55) / (24*sqrt(5)), where C = Sum_{k>=1} (-1)^(k+1)*1/Cat(k), where Cat(k) = (2k)!/k!/(k+1)! = A000108(k) - k-th Catalan number. See Sep 01 2006 comment at ref. Mathematics in Russian. - Alexander Adamchuk, Dec 27 2013
Equals sqrt(5)/4 * Sum_{n>=0} (-1)^n/((2n+1)*C(2*n,n)) = sqrt(5) *A344041 /4. - Alexander Adamchuk, Dec 27 2013
Equals sqrt((Pi^2/6 - W)/3), where W = Sum_{n>=0} (-1)^n/((2n+1)^2*C(2*n,n)) = A145436, attributed by Alexander Adamchuk to Ramanujan. See Sep 01 2006 comment at ref. Mathematics in Russian. - Alexander Adamchuk, Dec 27 2013
Equals lim_{j->infinity} Sum_{k=F(j)..F(j+1)-1} (1/k), where F = A000045, the Fibonacci sequence. Convergence is slow. For example: Sum_{k=21..33} (1/k) = 0.4910585.... - Richard R. Forberg, Aug 15 2014
Equals Sum_{k>=1} cos(Pi*k/5)/k. - Amiram Eldar, Aug 12 2020
Equals real solution to exp(x)+exp(2*x) = exp(3*x). - Alois P. Heinz, Jul 14 2022
Equals arccoth(sqrt(5)). - Amiram Eldar, Feb 09 2024
Sum_{n >= 1} 1/(n*P(n, sqrt(5))*P(n-1, sqrt(5))), where P(n, x) denotes the n-th Legendre polynomial. The first ten terms of the series gives the approximation log((1 + sqrt(5))/2) = 0.481211825059(39..), correct to 12 decimal places. - Peter Bala, Mar 16 2024
Equals Sum_{n>=0} ((-1)^(n)*binomial(2*n, n))/(2^(4*n + 1)*(2*n + 1)). - Antonio Graciá Llorente, Nov 13 2024

A080891 Period 5: repeat [0, 1, -1, -1, 1].

Original entry on oeis.org

0, 1, -1, -1, 1, 0, 1, -1, -1, 1, 0, 1, -1, -1, 1, 0, 1, -1, -1, 1, 0, 1, -1, -1, 1, 0, 1, -1, -1, 1, 0, 1, -1, -1, 1, 0, 1, -1, -1, 1, 0, 1, -1, -1, 1, 0, 1, -1, -1, 1, 0, 1, -1, -1, 1, 0, 1, -1, -1, 1, 0, 1, -1, -1, 1, 0, 1, -1, -1, 1, 0, 1, -1, -1, 1, 0, 1, -1, -1, 1, 0, 1, -1, -1, 1, 0, 1, -1, -1, 1, 0, 1, -1, -1, 1, 0, 1, -1, -1, 1, 0

Offset: 0

N. J. A. Sloane, Sep 23 2003

a(n) = (5/n), where (k/n) is the Kronecker symbol.
L(1;5) (Dirichlet L-series) is the integral from 0 to 1 of the g.f. of a(n+1). Partial sums are A092202. - Paul Barry, Apr 01 2005
From R. J. Mathar, Jul 15 2010, simplified Jul 27 2010: (Start)
The sequence is the real non-principal Dirichlet character mod 5. (The principal character mod 5 is A011558.)
Associated Dirichlet L-functions are, for example, L(1,chi) = Sum_{n>=1} a(n)/n = A086466 or L(2,chi) = Sum_{n>=1} a(n)/n^2 = 0.7062114... = 4*Pi^2/(25*sqrt(5)). (End)
This sequence {a(n)} appears in the formula 2*exp(2*Pi*n*i/5) = (A(n) + a(n)*phi) + (C(n) + D(n)*phi)*sqrt(2 + phi)*i, with the golden section phi, i = sqrt(-1) and A(n) = A164116(n+5), C(n) = A156174(n+4) and D(n) = A010891(n+3) for n >= 0. See a comment on A164116. - Wolfdieter Lang, Feb 26 2014
In Gil and Robins 2003 on page 33 the g.f. is denoted by f_{4, 4}(x). - Michael Somos, Sep 04 2015

			G.f. = x - x^2 - x^3 + x^4 + x^6 - x^7 - x^8 + x^9 + x^11 - x^12 - x^13 + ...

T. M. Apostol, Introduction to Analytic Number Theory, Springer-Verlag, 1986, page 139, k=5, Chi_2(n).
H. Cohn, Advanced Number Theory, Dover Publications, Inc., 1962, p. 173.

J. B. Gil and S. Robins, Hecke operators on rational functions, arXiv:math/0309244 [math.NT], 2003.
J.-P. Serre, On a theorem of Jordan, Bull. Amer. Math. Soc., 40 (No. 4, 2003), 429-440, see p. 435.
Eric Weisstein's World of Mathematics, Kronecker Symbol.
Index to divisibility sequences
Index entries for linear recurrences with constant coefficients, signature (-1,-1,-1,-1).
Index entries for two-way infinite sequences

Cf. A011558, A086937, A100047.

&cat [[0, 1, -1, -1, 1]^^30]; // Wesley Ivan Hurt, Dec 26 2016

A080891 := proc(n) numtheory[jacobi](n,5) ; end proc: seq(A080891(n),n=0..100) ; # R. J. Mathar, Jul 29 2010

a[ n_] := Mod[n^2 + 1, 5] - 1; (* Michael Somos, May 24 2015 *)
a[ n_] := KroneckerSymbol[ n, 5]; (* Michael Somos, May 24 2015 *)
a[ n_] := {1, -1, -1, 1, 0}[[Mod[n, 5, 1]]]; (* Michael Somos, May 24 2015 *)
PadRight[{},120,{0,1,-1,-1,1}] (* Harvey P. Dale, Nov 30 2023 *)

numlib::jacobi(n,5)$ n=0..100 // Zerinvary Lajos, May 13 2008

a(n)=kronecker(5,n) /* Also, a(n)=kronecker(n,5) */

{a(n) = (n^2 + 1)%5 - 1}; /* Michael Somos, Dec 01 2004 */

If n == 0 (mod 5) a(n)=0; if n == 1 or 4 (mod 5) a(n)=1; if n == 2 or 3 (mod 5) a(n)=-1.
G.f.: x*(1-x^2)/(1+x+x^2+x^3+x^4). - Paul Barry, Apr 01 2005
G.f.: x * (1 - x) * (1 - x^2) / (1 - x^5). a(n) = a(-n) = a(n+5) for all n in Z. - Michael Somos, Jun 17 2005
Euler transform of length 5 sequence [-1, -1, 0, 0, 1]. - Michael Somos, Jun 17 2005
Transform of the Fibonacci numbers by the Riordan array A102587. - Paul Barry, Jul 14 2005
a(n) = -1 + floor(12002/99999*10^(n+1)) mod 10. - Hieronymus Fischer, Jan 04 2013
a(n) = -1 + floor(137/242*3^(n+1)) mod 3. - Hieronymus Fischer, Jan 04 2013
|A011558(n)| = |a(n)| = |A100047(n)|. - Michael Somos, May 24 2015
a(n) is completely multiplicative with a(p) = Kronecker(5, p). - Michael Somos, Jun 17 2015
From Wesley Ivan Hurt, Dec 26 2016: (Start)
a(n) = a(n-5) for n > 4.
a(n) + a(n-1) + a(n-2) + a(n-3) + a(n-4) = 0 for n > 3.
a(n) = 1 + 2*floor((n-4)/5) - 2*floor((n-2)/5) + floor((n-1)/5) - floor(n/5). (End)
a(n) = 2*(cos(2*n*Pi/5) - cos(4*n*Pi/5))/sqrt(5). - Wesley Ivan Hurt, Sep 26 2018
a(n) = a(n-1)*a(n-4) - a(n-2)*a(n-3) for n > 3. - Nicolas Bělohoubek, May 21 2024
a(n) = n^2 - 5*floor((n^2+1)/5). - Aaron J Grech, Aug 28 2024

Name specified by Wolfdieter Lang, Feb 26 2014

A035187 Sum over divisors d of n of Kronecker symbol (5|d).

Original entry on oeis.org

1, 0, 0, 1, 1, 0, 0, 0, 1, 0, 2, 0, 0, 0, 0, 1, 0, 0, 2, 1, 0, 0, 0, 0, 1, 0, 0, 0, 2, 0, 2, 0, 0, 0, 0, 1, 0, 0, 0, 0, 2, 0, 0, 2, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 2, 0, 0, 0, 2, 0, 2, 0, 0, 1, 0, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0, 2, 0, 0, 2, 1, 1, 0, 0, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0, 0, 2, 0, 0, 0, 2, 1, 2, 0, 0, 0, 0

Offset: 1

N. J. A. Sloane

Let tau be the golden ratio (1+sqrt(5))/2; let zetaQ(tau)(s)=sum(1/(Z(tau):a)^s) the Dedekind zeta function where a runs through the nonzero ideals of Z(tau) and where (Z(tau):a) is the norm of a; then zetaQ(tau)(s)=sum(n>=1,a(n)/n^s). - Benoit Cloitre, Dec 29 2002
First occurrence of k beginning at zero, or 0 if not yet known: 2, 1, 11, 121, 209, 14641, 2299, 1771561, 6061, 43681, 278179, 0, 66671, 0, 33659659, 5285401, 187891, 0, 1266749, 0, 8067191, 639533521, 0, 0, 2066801, 0, 0, 36735721, 976130111, 0, 153276629, 0, 7703531, 0, 0, 0, 39269219, 0, 0, 0, 250082921, 0, 0, 0, 0, 0, 0, 0, 84738841, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 454508329, ..., .
If k is prime, the 0 above can be replaced by the smallest p^(k-1) with p a prime == {1,4} (mod 5), which is p=11. This follows from the multiplicative formula. - R. J. Mathar, Apr 02 2011
The terms often equal A001157(n) mod 5; the exceptions are at n = 2299, 3509, 3751, 3971, 4961, 6061, 6479, ... - R. J. Mathar, Apr 02 2011
Coefficients of Dedekind zeta function for the quadratic number field of discriminant 5. See A002324 for formula and Maple code. - N. J. A. Sloane, Mar 22 2022

			G.f. = x + x^4 + x^5 + x^9 + 2*x^11 + x^16 + 2*x^19 + x^20 + x^25 + 2*x^29 + ...

G. C. Greubel, Table of n, a(n) for n = 1..5000
M. Baake, Algebra, Combinatorics and Number Theory.
M. Baake and R. V. Moody, Similarity submodules and root systems in four dimensions, arXiv:math/9904028 [math.MG], 1999.
M. Baake and R. V. Moody, Similarity submodules and root systems in four dimensions, Canad. J. Math. 51 (1999), 1258-1276.

Cf. A031363 (for indices of nonzero terms), A078428.
Cf. A001622, A086466.
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.

A035187 := proc(n) local f,p; f := ifactors(n)[2] ; if nops(f) = 1 then p := op(1,f) ; if op(1,p) = 5 then 1; elif op(1,p) mod 5 in {1,4} then op(2,p)+1 ; else (1+(-1)^op(2,p))/2 ; end if; else mul(procname(op(1,p)^op(2,p) ),p=f) ; end if;
end proc: # R. J. Mathar, Apr 02 2011

f[n_] := Plus @@ (KroneckerSymbol[5, #] & /@ Divisors@ n); Array[f, 105] (* Robert G. Wilson v *)
a[ n_] := If[ n < 1, 0, DivisorSum[ n, KroneckerSymbol[ 5, #] &]]; (* Michael Somos, Jun 12 2014 *)

{a(n) = if( n<1, 0, direuler( p=2, n, 1 / (1 - X) / (1 - kronecker( 5, p) * X))[n])}; \\ Michael Somos, Jun 06 2005

{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==5, 1, if((p%5==1) || (p%5==4), e+1, !(e%2))))))}; \\ Michael Somos, Jun 06 2005

{a(n) = if( n<1, 0, sumdiv( n, d, kronecker( 5, d) ) )}; \\ Michael Somos, Oct 29 2005

Dirichlet g.f.: Product_p ( (1 - p^(-s)) (1 - Kronecker( 5, p)*p^(-s)) )^(-1).
Sum_{k=1..n} a(k) is asymptotic to c*n where c=2*log(tau)/sqrt(5) (A086466).
Multiplicative with a(5^e) = 1, a(p^e) = e+1 if p == 1, 4 (mod 5), a(p^e) = (1+(-1)^e)/2 if p == 2, 3 (mod 5). - Michael Somos, Jun 06 2005
Moebius transform is period 5 sequence A080891. - Michael Somos, Oct 29 2005
q-series for a(n): Sum_{n >= 1} -(-1)^nq^(n(n+1)/2)(1-q)(1-q^2)...(1-q^(n-1))/((1-q^(n+1))(1-q^(n+2))...(1-q^(2n))). - Jeremy Lovejoy, Jun 12 2009

A005430 Apéry numbers: nC(2n,n).

Original entry on oeis.org

0, 2, 12, 60, 280, 1260, 5544, 24024, 102960, 437580, 1847560, 7759752, 32449872, 135207800, 561632400, 2326762800, 9617286240, 39671305740, 163352435400, 671560012200, 2756930576400, 11303415363240, 46290177201840, 189368906734800, 773942488394400

Offset: 0

Simon Plouffe

Appears as diagonal in A003506. - Zerinvary Lajos, Apr 12 2006
The aerated sequence 1,0,2,0,12,0,60,0,... has e.g.f. 1+x*Bessel_I(1,2x). - Paul Barry, Mar 29 2010
Conjecture: the terms of the inverse binomial transform are 2*A132894(n). - R. J. Mathar, Oct 21 2012

Frank Harary and Edgar M. Palmer, Graphical Enumeration, Academic Press, NY, 1973, p. 78, (3.5.25).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

T. D. Noe, Table of n, a(n) for n = 0..200
Kunle Adegoke, Robert Frontczak, and Taras Goy, Fibonacci-Catalan Series, Integers: Electronic Journal of Combinatorial Number Theory, Vol. 22 (2022), #A110.
Laurent Alonso and Edward M. Reingold, Analysis of Boyer and Moore's MJRTY Algorithm, 2012.
T. Amdeberhan and Henri Cohen, Bernoulli sum meets golden number, MathOverflow, version of 2017-06-15.
Libor Caha and Daniel Nagaj, The pair-flip model: a very entangled translationally invariant spin chain, arXiv:1805.07168 [quant-ph], 2018.
Benjamin Ruoyu Kan, Polynomial Approximations for Quantum Hamiltonian Complexity, Bachelor's thesis, Harvard Univ., 2023.
Hans J. H. Tuenter, Walking into an absolute sum, arXiv:math/0606080 [math.NT], 2006. Published version on Walking into an absolute sum, The Fibonacci Quarterly, 40(2):175-180, May 2002.
Alfred J. van der Poorten, A proof that Euler missed ... Apery's proof of the irrationality of zeta(3), Math. Intelligencer 1 (1978/1979), 195-203.
I. J. Zucker, On the series Sum(k>=1) C(2k,k)^(-1)*k^(-n) and related sums, J. Number Theory, Vol. 20, No. 1 (1985), 92-102.
Wadim Zudilin, An elementary proof of Apery's theorem, arXiv:math/0202159 [math.NT], 2002.

Cf. A002011, A002457, A002736, A005258, A005259, A005429, 1/beta(n, n+1) in A061928.

Cf. A001803, A003506.

List([0..30], n-> n*Binomial(2*n,n)); # G. C. Greubel, Dec 09 2018

[n*Binomial(2*n,n): n in [0..30]]; // G. C. Greubel, Dec 09 2018

Maple
```
A005430 := n -> n*binomial(2*n, n);
```

Table[n*Binomial[2n,n],{n,0,30}] (* Harvey P. Dale, May 29 2015 *)

a(n)=-(-1)^n*real(polcoeff(serlaplace(x^2*besselh1(1,2*x)),2*n)) \\ Ralf Stephan

[n*binomial(2*n,n) for n in range(30)] # G. C. Greubel, Dec 09 2018

a(n) = A002011(n-1)/2 = 2 * A002457(n-1).
Sum_{n >= 1} 1/a(n) = Pi*sqrt(3)/9. - Benoit Cloitre, Apr 07 2002
G.f.:  2*x/sqrt((1-4*x)^3). - Marco A. Cisneros Guevara, Jul 25 2011
E.g.f.: a(n) = n!* [x^n] exp(2*x)*2*x*(BesselI(0, 2*x)+BesselI(1, 2*x)). - Peter Luschny, Aug 25 2012
D-finite with recurrence (-n+1)*a(n) + 2*(2*n-1)*a(n-1) = 0. - R. J. Mathar, Dec 03 2012
G.f.: 2*x*(1-4*x)^(-3/2) = -G(0)/2 where G(k) =  1 - (2*k+1)/(1 - 2*x/(2*x - (k+1)/G(k+1) )); (recursively defined continued fraction). - Sergei N. Gladkovskii, Dec 06 2012
a(n-1) = Sum_{k=0..floor(n/2)} k*C(n,k)*C(n-k,k)*2^(n-2*k). - Robert FERREOL, Aug 29 2015
From Ilya Gutkovskiy, Jan 17 2017: (Start)
a(n) ~ 4^n*sqrt(n)/sqrt(Pi).
Sum_{n>=1} (-1)^(n+1)/a(n) = 2*log(phi)/sqrt(5) = A086466, where phi is the golden ratio. (End)
1/a(n) = (-1)^n*Sum_{j=0..n-1} binomial(n-1,j)*Bernoulli(j+n)/(j+n) for n >= 1. See the Amdeberhan & Cohen link. - Peter Luschny, Jun 20 2017
1/a(n) = Sum_{k=0..n} (-1)^(k+1)*binomial(n,k)*HarmonicNumber(n+k) for n >= 1. - Peter Luschny, Aug 15 2017
Sum_{n>=1} x^n/a(n) = 2*sqrt(x/(4-x))*arcsin(sqrt(x)/2), for abs(x) < 4 (Adegoke et al., 2022, section 6, p. 11). - Amiram Eldar, Dec 07 2024

More terms from James Sellers, May 01 2000

A241269 Denominator of c(n) = (n^2+n+2)/((n+1)(n+2)(n+3)).

Original entry on oeis.org

3, 6, 15, 60, 105, 21, 126, 360, 495, 330, 429, 1092, 1365, 420, 1020, 2448, 2907, 1710, 1995, 4620, 5313, 759, 3450, 7800, 8775, 4914, 5481, 12180, 13485, 3720, 8184, 17952, 19635, 10710, 11655, 25308, 27417, 3705, 15990, 34440, 37023, 19866, 21285, 45540

Offset: 0

Paul Curtz, Apr 18 2014

All terms are multiples of 3.
Difference table of c(n):
   1/3,     1/6,    2/15,    7/60,    2/21,...
  -1/6,    -1/30,  -1/60,   -1/84,   -1/105,...
   2/15,    1/60,   1/210,   1/420,   1/630,...
  -7/60,   -1/84,  -1/420,  -1/1260, -1/2520,... .
This is an autosequence of the second kind; the inverse binomial transform is the signed sequence. The main diagonal is the first upper diagonal multiplied by 2.
Denominators of the main diagonal: A051133(n+1).
Denominators of the first upper diagonal; A000911(n).
c(n) is a companion to A026741(n)/A045896(n).
Based on the Akiyama-Tanigawa transform applied to 1/(n+1) which yields the Bernoulli numbers A164555(n)/A027642(n).
Are the numerators of the main diagonal (-1)^n? If yes, what is the value of 1/3 - 1/30 + 1/210,... or 1 - 1/10 + 1/70 - 1/420, ... , from A002802(n)?
Is a(n+40) - a(n) divisible by 10?
No: a(5) = 21 but a(45) = 12972. # Robert Israel, Jul 17 2023
Are the common divisors to A014206(n) and A007531(n+3) of period 16: repeat 2, 4, 4, 2, 2, 16, 4, 2, 2, 4, 4, 2, 2, 8, 4, 2?
Reduce c(n) = f(n) = b(n)/a(n) = 1/3, 1/6, 2/15, 7/60, 11/105, 2/21, 11/126, 29/360, ... .
Consider the successively interleaved autosequences (also called eigensequences) of the second kind and of the first kind
  1,    1/2,  1/3,    1/4,     1/5,     1/6,   ...
  0,    1/6,  1/6,    3/20,    2/15,    5/42,  ...
  1/3,  1/6,  2/15,   7/60,   11/105,   2/21,  ...
  0,    1/10, 1/10,  13/140,   3/35,    5/63,  ...
  1/5,  1/10, 3/35,  11/140,  23/315,  43/630, ...
  0,    1/14, 1/14,  17/252,   4/63,   ...
This array is Au1(m,n). Au1(0,0)=1, Au1(0,1)=1/2.
Au1(m+1,n) = 2*Au1(m,n+1) - Au1(m,n).
First row: see A003506, Leibniz's Harmonic Triangle.
Second row: A026741/A045896.
a(n) is the denominator of the third row f(n).
The first column is 1, 0, 1/3, 0, 1/5, 0, 1/7, 0, ... . Numerators: A093178(n+1). This incites, considering tan(1), to introduce before the first row
Ta0(n) = 0, 1/2, 1/2, 5/12, 1/3, 4/15, 13/60, 151/840, ... .

Robert Israel, Table of n, a(n) for n = 0..10000

seq(denom((n^2+n+2)/((n+1)*(n+2)*(n+3))),n=0..1000);

Denominator[Table[(n^2+n+2)/Times@@(n+{1,2,3}),{n,0,50}]] (* Harvey P. Dale, Mar 27 2015 *)

for(n=0, 100, print1(denominator((n^2+n+2)/((n+1)*(n+2)*(n+3))), ", ")) \\ Colin Barker, Apr 18 2014

c(n) = A014206(n)/A007531(n+3).
The sum of the difference table main diagonal is 1/3 - 1/30 + 1/210 - ... = 10*A086466-4 = 4*(sqrt(5)*log(phi)-1) = 0.3040894... - Jean-François Alcover, Apr 22 2014
a(n) = (n+1)*(n+2)*(n+3)/gcd(4*n - 4, n^2 + n + 2), where gcd(4*n - 4, n^2 + n + 2) is periodic with period 16. - Robert Israel, Jul 17 2023

More terms from Colin Barker, Apr 18 2014

A328717 Decimal expansion of Sum_{k>=1} Kronecker(5,k)/k^2.

Original entry on oeis.org

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

Offset: 0

Jianing Song, Nov 19 2019

Let Chi() be a primitive character modulo d, the so-called Dirichlet L-series L(s,Chi) is the analytic continuation (see the functional equations involving L(s,Chi) in the MathWorld link entitled Dirichlet L-Series) of the sum Sum_{k>=1} Chi(k)/k^s, Re(s)>0 (if d = 1, the sum converges requires Re(s)>1).
If s != 1, we can represent L(s,Chi) in terms of the Hurwitz zeta function by L(s,Chi) = (Sum_{k=1..d} Chi(k)*zeta(s,k/d))/d^s.
L(s,Chi) can also be represented in terms of the polylog function by L(s,Chi) = (Sum_{k=1..d} Chi'(k)*polylog(s,u^k))/(Sum_{k=1..d} Chi'(k)*u^k), where Chi' is the complex conjugate of Chi, u is any primitive d-th root of unity.
If m is a positive integer, we have L(m,Chi) = (Sum_{k=1..d} Chi(k)*polygamma(m-1,k/d))/((-d)^m*(m-1)!).
In this sequence we have Chi = A080891 and s = 2.

			1 - 1/2^2 - 1/3^2 + 1/4^2 + 1/6^2 - 1/7^2 - 1/8^2 + 1/9^2 + ... = 4*Pi^2/(25*sqrt(5)) = 0.70621140325974096993100317576256402766024647185294...

M. W. Coffey, Summatory relations and prime products for the Stieltjes constants and other related results, arXiv:1701.07064 [math.NT], 2017, eq. (2.1).
H.-J. Seiffert, Problem B-705, Elementary Problems and Solutions, The Fibonacci Quarterly, Vol. 29, No. 4 (1991), p. 372; An Application of a Series Expansion for (arcsinx)^2, Solution to Problem B-705, ibid., Vol. 31, No. 1 (1993), pp. 85-86.
Eric Weisstein's World of Mathematics, Dirichlet L-Series.
Eric Weisstein's World of Mathematics, Polygamma Function.

Cf. A000045, A001906, A002736, A080891.
Decimal expansion of Sum_{k>=1} Kronecker(d,k)/k^2, where d is a fundamental discriminant: A309710 (d=-8), A103133 (d=-7), A006752 (d=-4), A086724 (d=-3), A013661 (d=1), this sequence (d=5), A328895 (d=8), A258414 (d=12).
Decimal expansion of Sum_{k>=1} Kronecker(5,k)/k^s: A086466 (s=1), this sequence (s=2), A328723 (s=3).

RealDigits[4*Pi^2/(25*Sqrt[5]), 10, 102] // First

default(realprecision, 100); 4*Pi^2/(25*sqrt(5))

Equals 4*Pi^2/(25*sqrt(5)).
Equals (zeta(2,1/5) - zeta(2,2/5) - zeta(2,3/5) + zeta(2,4/5))/25, where zeta(s,a) is the Hurwitz zeta function.
Equals (polylog(2,u) - polylog(2,u^2) - polylog(2,u^3) + polylog(2,u^4))/sqrt(5), where u = exp(2*Pi*i/5) is a 5th primitive root of unity, i = sqrt(-1).
Equals (polygamma(1,1/5) - polygamma(1,2/5) - polygamma(1,3/5) - polygamma(1,4/5))/25.
Equals Sum_{k>=1} Fibonacci(2*k)/(k^2*binomial(2*k,k)) = Sum_{k>=1} A001906(k)/A002736(k) (Seiffert, 1991). - Amiram Eldar, Jan 17 2022
Equals 1/(Product_{p prime == 1 or 4 (mod 5)} (1 - 1/p^2) * Product_{p prime == 2 or 3 (mod 5)} (1 + 1/p^2)). - Amiram Eldar, Dec 17 2023

A086465 Decimal expansion of (5 + 4sqrt(5)arcsch(2))/25.

Original entry on oeis.org

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

Offset: 0

Eric W. Weisstein, Jul 21 2003

			0.37216357638560161555577...

D. H. Lehmer, Interesting series involving the Central Binomial Coefficient, Am. Math. Monthly 92, No. 7 (1985) 449-457.
Eric Weisstein's World of Mathematics, Central Binomial Coefficient.
Wikipedia, Inverse hyperbolic function: Series expansions.
Index entries for transcendental numbers.

Cf. A086466, A086467, A086468.

2/625*(14*sqrt(5)*log((1+sqrt(5))/2)+5) ; # R. J. Mathar, Mar 04 2009

RealDigits[(5 + 4*Sqrt[5]*ArcSinh[1/2])/25, 10, 120][[1]] (* Amiram Eldar, May 25 2023 *)

suminf(n=1, (-1)^(n-1)/binomial(2*n,n)) \\ Michel Marcus, Jul 31 2015

asinh(.5)*sqrt(5)*.16+.2 \\ Use \p99 to get 99 digits. - M. F. Hasler, Jul 31 2015

Equals Sum_{n>=1} (-1)^(n-1)/binomial(2*n,n).

Corrected definition and digits by a factor of 25/24. - R. J. Mathar, Mar 04 2009

A000911 a(n) = (2n+3)! /( n! * (n+1)! ).

Original entry on oeis.org

6, 60, 420, 2520, 13860, 72072, 360360, 1750320, 8314020, 38798760, 178474296, 811246800, 3650610600, 16287339600, 72129646800, 317370445920, 1388495700900, 6044040109800, 26190840475800, 113034153632400, 486046860619320, 2083057974082800, 8900338616535600

Offset: 0

N. J. A. Sloane

nonn

			6 + 60*x + 420*x^2 + 2520*x^3 + 13860*x^4 + 72072*x^5 + 360360*x^6 + ...

E. R. Hansen, A Table of Series and Products, Prentice-Hall, Englewood Cliffs, NJ, 1975, p. 99.

T. D. Noe, Table of n, a(n) for n = 0..200

Cf. A000217, A000984, A001801, A002802, A051133, A086466, A093602.

seq(binomial(2*n,n)*binomial(n,(n-2)), n=2..21); # Zerinvary Lajos, May 10 2007

Table[(2 n + 3)!/(n!*(n + 1)!), {n, 0, 20}] (* T. D. Noe, Jun 20 2012 *)

a(n) = 2^(n+4)*polcoeff(pollegendre(n+4),n) /* Ralf Stephan */

a(n) = 2 * A051133(n+1).
a(n) = A000984(n+1)*A000217(n). - Zerinvary Lajos, May 10 2007
a(n) = 6 * A002802(n). - Zerinvary Lajos, Jun 02 2007
n*a(n) - 2*(2*n+3)*a(n-1) = 0. - R. J. Mathar, Jun 07 2013
G.f.: 6*(1+10*x/( G(0)- 10*x)), where G(k)= 2*x*(2*k+5) + k + 1 - 2*x*(k+1)*(2*k+7)/G(k+1); (continued fraction). - Sergei N. Gladkovskii, Jul 14 2013
Sum_{n>=0} (-1)^n/a(n) = 5*A086466-2 = 2*log(phi)*sqrt(5)-2 = 0.1520447... - Jean-François Alcover, Apr 22 2014
From Ilya Gutkovskiy, Jan 31 2017: (Start)
G.f.: 6/(1 - 4*x)^(5/2).
a(n) ~ 2^(2*n+3)*n^(3/2)/sqrt(Pi). (End)
Sum_{n>=0} 1/a(n) = 2 - Pi/sqrt(3) = 2 - A093602. - Amiram Eldar, Oct 13 2020

A086467 Decimal expansion of 2*arccsch(2)^2.

Original entry on oeis.org

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

Offset: 0

Eric W. Weisstein, Jul 21 2003

			0.4631296...

Steven R. Finch, Mathematical Constants II, Encyclopedia of Mathematics and Its Applications, Cambridge University Press, Cambridge, 2018, p. 77.
Renzo Sprugnoli, Sums of reciprocals of the central binomial coefficients, INTEGERS 6 (2006) #A27
Eric Weisstein's World of Mathematics, Central Binomial Coefficient
Index entries for transcendental numbers

Cf. A086465, A086466, A086468.

RealDigits[2ArcCsch[2]^2,10,120][[1]] (* Harvey P. Dale, Mar 07 2012 *)

suminf(n=1, (-1)^(n-1)/n^2/binomial(2*n,n)) \\ Michel Marcus, Jul 31 2015

2*asinh(.5)^2 \\ Charles R Greathouse IV, Nov 21 2024

Equals Sum_{n>=1} (-1)^(n-1)/n^2/binomial(2*n,n).
Equals Integral_{x=0..1} log(1+x-x^2)/x dx. - Vaclav Kotesovec, Jun 13 2021
Equals 2*A002390^2. - R. J. Mathar, Jun 07 2024

A086468 Decimal expansion of 2*zeta(3)/5.

Original entry on oeis.org

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

Offset: 0

Eric W. Weisstein, Jul 21 2003

			0.48082276126383771415989526460457999630599451693620...

Alexander Apelblat, Tables of Integrals and Series, Harri Deutsch, (1996), 4.1.46.
Steven R. Finch, Mathematical Constants, Encyclopedia of Mathematics and its Applications, vol. 94, Cambridge University Press, 2003, Section 1.6.3, p. 43.

G. C. Greubel, Table of n, a(n) for n = 0..10000
Michael I. Shamos, A catalog of the real numbers, (2007). See p. 446.
Eric Weisstein's World of Mathematics, Central Binomial Coefficient.

Cf. A002117, A086465, A086466, A086467.

SetDefaultRealField(RealField(250)); L:=RiemannZeta();  2*Evaluate(L,3)/5; // G. C. Greubel, Nov 02 2018

First[RealDigits[N[2*Zeta[3]/5, 100]]] (* Stefano Spezia, Nov 02 2018 *)

2*zeta(3)/5 \\ Michel Marcus, Nov 02 2018

Equals Sum_{n>=1} (-1)^(n-1)/(n^3*binomial(2*n,n)).
Equals 2*A002117/5. - R. J. Mathar, Feb 08 2009
Equals (1/10)*Sum_{k>=1} (30*k - 11)/((2*k - 1)*k^3*binomial(2*k,k)^2) (see Finch). - Stefano Spezia, Nov 01 2024

cp's OEIS Frontend

A002390 Decimal expansion of natural logarithm of golden ratio.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Formula

A080891 Period 5: repeat [0, 1, -1, -1, 1].

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Magma

Maple

Mathematica

MuPAD

PARI

PARI

Formula

Extensions

A035187 Sum over divisors d of n of Kronecker symbol (5|d).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

PARI

PARI

PARI

Formula

A005430 Apéry numbers: n*C(2*n,n).

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

GAP

Magma

Maple

Mathematica

PARI

Sage

Formula

Extensions

A241269 Denominator of c(n) = (n^2+n+2)/((n+1)*(n+2)*(n+3)).

Views

Author

Keywords

Comments

Links

Programs

Maple

Mathematica

PARI

Formula

Extensions

A328717 Decimal expansion of Sum_{k>=1} Kronecker(5,k)/k^2.

Views

Author

A005430 Apéry numbers: nC(2n,n).

A241269 Denominator of c(n) = (n^2+n+2)/((n+1)(n+2)(n+3)).

A086465 Decimal expansion of (5 + 4sqrt(5)arcsch(2))/25.