A002117 -id:A002117 - cp's OEIS frontend

A000578 The cubes: a(n) = n^3.

0, 1, 8, 27, 64, 125, 216, 343, 512, 729, 1000, 1331, 1728, 2197, 2744, 3375, 4096, 4913, 5832, 6859, 8000, 9261, 10648, 12167, 13824, 15625, 17576, 19683, 21952, 24389, 27000, 29791, 32768, 35937, 39304, 42875, 46656, 50653, 54872, 59319, 64000, 68921, 74088, 79507

Offset: 0

N. J. A. Sloane

a(n) is the sum of the next n odd numbers; i.e., group the odd numbers so that the n-th group contains n elements like this: (1), (3, 5), (7, 9, 11), (13, 15, 17, 19), (21, 23, 25, 27, 29), ...; then each group sum = n^3 = a(n). Also the median of each group = n^2 = mean. As the sum of first n odd numbers is n^2 this gives another proof of the fact that the n-th partial sum = (n(n + 1)/2)^2. - Amarnath Murthy, Sep 14 2002
Total number of triangles resulting from criss-crossing cevians within a triangle so that two of its sides are each n-partitioned. - Lekraj Beedassy, Jun 02 2004. See Propp and Propp-Gubin for a proof.
Also structured triakis tetrahedral numbers (vertex structure 7) (cf. A100175 = alternate vertex); structured tetragonal prism numbers (vertex structure 7) (cf. A100177 = structured prisms); structured hexagonal diamond numbers (vertex structure 7) (cf. A100178 = alternate vertex; A000447 = structured diamonds); and structured trigonal anti-diamond numbers (vertex structure 7) (cf. A100188 = structured anti-diamonds). Cf. A100145 for more on structured polyhedral numbers. - James A. Record (james.record(AT)gmail.com), Nov 07 2004
Schlaefli symbol for this polyhedron: {4, 3}.
Least multiple of n such that every partial sum is a square. - Amarnath Murthy, Sep 09 2005
Draw a regular hexagon. Construct points on each side of the hexagon such that these points divide each side into equally sized segments (i.e., a midpoint on each side or two points on each side placed to divide each side into three equally sized segments or so on), do the same construction for every side of the hexagon so that each side is equally divided in the same way. Connect all such points to each other with lines that are parallel to at least one side of the polygon. The result is a triangular tiling of the hexagon and the creation of a number of smaller regular hexagons. The equation gives the total number of regular hexagons found where n = the number of points drawn + 1. For example, if 1 point is drawn on each side then n = 1 + 1 = 2 and a(n) = 2^3 = 8 so there are 8 regular hexagons in total. If 2 points are drawn on each side then n = 2 + 1 = 3 and a(n) = 3^3 = 27 so there are 27 regular hexagons in total. - Noah Priluck (npriluck(AT)gmail.com), May 02 2007
The solutions of the Diophantine equation: (X/Y)^2 - X*Y = 0 are of the form: (n^3, n) with n >= 1. The solutions of the Diophantine equation: (m^2)*(X/Y)^2k - XY = 0 are of the form: (m*n^(2k + 1), m*n^(2k - 1)) with m >= 1, k >= 1 and n >= 1. The solutions of the Diophantine equation: (m^2)*(X/Y)^(2k + 1) - XY = 0 are of the form: (m*n^(k + 1), m*n^k) with m >= 1, k >= 1 and n >= 1. - Mohamed Bouhamida, Oct 04 2007
Except for the first two terms, the sequence corresponds to the Wiener indices of C_{2n} i.e., the cycle on 2n vertices (n > 1). - K.V.Iyer, Mar 16 2009
Totally multiplicative sequence with a(p) = p^3 for prime p. - Jaroslav Krizek, Nov 01 2009
Sums of rows of the triangle in A176271, n > 0. - Reinhard Zumkeller, Apr 13 2010
One of the 5 Platonic polyhedral (tetrahedral, cube, octahedral, dodecahedral and icosahedral) numbers (cf. A053012). - Daniel Forgues, May 14 2010
Numbers n for which order of torsion subgroup t of the elliptic curve y^2 = x^3 - n is t = 2. - Artur Jasinski, Jun 30 2010
The sequence with the lengths of the Pisano periods mod k is 1, 2, 3, 4, 5, 6, 7, 8, 3, 10, 11, 12, 13, 14, 15, 16, 17, 6, 19, 20, ... for k >= 1, apparently multiplicative and derived from A000027 by dividing every ninth term through 3. Cubic variant of A186646. - R. J. Mathar, Mar 10 2011
The number of atoms in a bcc (body-centered cubic) rhombic hexahedron with n atoms along one edge is n^3 (T. P. Martin, Shells of atoms, eq. (8)). - Brigitte Stepanov, Jul 02 2011
The inverse binomial transform yields the (finite) 0, 1, 6, 6 (third row in A019538 and A131689). - R. J. Mathar, Jan 16 2013
Twice the area of a triangle with vertices at (0, 0), (t(n - 1), t(n)), and (t(n), t(n - 1)), where t = A000217 are triangular numbers. - J. M. Bergot, Jun 25 2013
If n > 0 is not congruent to 5 (mod 6) then A010888(a(n)) divides a(n). - Ivan N. Ianakiev, Oct 16 2013
For n > 2, a(n) = twice the area of a triangle with vertices at points (binomial(n,3),binomial(n+2,3)), (binomial(n+1,3),binomial(n+1,3)), and (binomial(n+2,3),binomial(n,3)). - J. M. Bergot, Jun 14 2014
Determinants of the spiral knots S(4,k,(1,1,-1)). a(k) = det(S(4,k,(1,1,-1))). - Ryan Stees, Dec 14 2014
One of the oldest-known examples of this sequence is shown in the Senkereh tablet, BM 92698, which displays the first 32 terms in cuneiform. - Charles R Greathouse IV, Jan 21 2015
From Bui Quang Tuan, Mar 31 2015: (Start)
We construct a number triangle from the integers 1, 2, 3, ... 2*n-1 as follows. The first column contains all the integers 1, 2, 3, ... 2*n-1. Each succeeding column is the same as the previous column but without the first and last items. The last column contains only n. The sum of all the numbers in the triangle is n^3.
Here is the example for n = 4, where 1 + 2*2 + 3*3 + 4*4 + 3*5 + 2*6 + 7 = 64 = a(4):
  1
  2  2
  3  3  3
  4  4  4  4
  5  5  5
  6  6
  7
(End)
For n > 0, a(n) is the number of compositions of n+11 into n parts avoiding parts 2 and 3. - Milan Janjic, Jan 07 2016
Does not satisfy Benford's law [Ross, 2012]. - N. J. A. Sloane, Feb 08 2017
Number of inequivalent face colorings of the cube using at most n colors such that each color appears at least twice. - David Nacin, Feb 22 2017
Consider A = {a,b,c} a set with three distinct members. The number of subsets of A is 8, including {a,b,c} and the empty set. The number of subsets from each of those 8 subsets is 27. If the number of such iterations is n, then the total number of subsets is a(n-1). - Gregory L. Simay, Jul 27 2018
By Fermat's Last Theorem, these are the integers of the form x^k with the least possible value of k such that x^k = y^k + z^k never has a solution in positive integers x, y, z for that k. - Felix Fröhlich, Jul 27 2018

			For k=3, b(3) = 2 b(2) - b(1) = 4-1 = 3, so det(S(4,3,(1,1,-1))) = 3*3^2 = 27.
For n=3, a(3) = 3 + (3*0^2 + 3*0 + 3*1^2 + 3*1 + 3*2^2 + 3*2) = 27. - _Patrick J. McNab_, Mar 28 2016

Albert H. Beiler, Recreations in the theory of numbers, New York, Dover, (2nd ed.) 1966. See p. 191.
John H. Conway and Richard K. Guy, The Book of Numbers, New York: Springer-Verlag, 1996. See pp. 43, 64, 81.
R. L. Graham, D. E. Knuth, and O. Patashnik, Concrete Mathematics. Addison-Wesley, Reading, MA, 1990, p. 255; 2nd. ed., p. 269. Worpitzky's identity (6.37).
Jan Gullberg, Mathematics from the Birth of Numbers, W. W. Norton & Co., NY & London, 1997, §8.6 Figurate Numbers, p. 292.
T. Aaron Gulliver, "Sequences from cubes of integers", International Mathematical Journal, 4 (2003), no. 5, 439 - 445. See http://www.m-hikari.com/z2003.html for information about this journal. [I expanded the reference to make this easier to find. - N. J. A. Sloane, Feb 18 2019]
J. Propp and A. Propp-Gubin, "Counting Triangles in Triangles", Pi Mu Epsilon Journal (to appear).
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).
James J. Tattersall, Elementary Number Theory in Nine Chapters, Cambridge University Press, 1999, pages 6-7.
D. Wells, You Are A Mathematician, pp. 238-241, Penguin Books 1995.

N. J. A. Sloane, Table of n, a(n) for n = 0..10000
H. Bottomley, Illustration of initial terms
British National Museum, Tablet 92698
N. Brothers, S. Evans, L. Taalman, L. Van Wyk, D. Witczak, and C. Yarnall, Spiral knots, Missouri J. of Math. Sci., 22 (2010).
M. DeLong, M. Russell, and J. Schrock, Colorability and determinants of T(m,n,r,s) twisted torus knots for n equiv. +/-1(mod m), Involve, Vol. 8 (2015), No. 3, 361-384.
Ralph Greenberg, Math For Poets
R. K. Guy, The strong law of small numbers. Amer. Math. Monthly 95 (1988), no. 8, 697-712. [Annotated scanned copy]
Milan Janjic, Enumerative Formulas for Some Functions on Finite Sets [Cached version at the Wayback Machine]
Hyun Kwang Kim, On Regular Polytope Numbers, Proc. Amer. Math. Soc., 131 (2002), 65-75. - fixed by _Felix Fröhlich_, Jun 16 2014
T. P. Martin, Shells of atoms, Phys. Reports, 273 (1996), 199-241, eq. (8).
Ed Pegg, Jr., Sequence Pictures, Math Games column, Dec 08 2003.
Ed Pegg, Jr., Sequence Pictures, Math Games column, Dec 08 2003 [Cached copy, with permission (pdf only)]
Simon Plouffe, Approximations de séries génératrices et quelques conjectures, Dissertation, Université du Québec à Montréal, 1992; arXiv:0911.4975 [math.NT], 2009.
Simon Plouffe, 1031 Generating Functions, Appendix to Thesis, Montreal, 1992
James Propp and Adam Propp-Gubin, Counting Triangles in Triangles, arXiv:2409.17117 [math.CO], 25 September 2024.
Kenneth A. Ross, First Digits of Squares and Cubes, Math. Mag. 85 (2012) 36-42. doi:10.4169/math.mag.85.1.36.
Eric Weisstein's World of Mathematics, Cubic Number, and Hex Pyramidal Number
Ronald Yannone, Hilbert Matrix Analyses
Index entries for linear recurrences with constant coefficients, signature (4,-6,4,-1).
Index entries for "core" sequences
Index entries for sequences related to Benford's law

(1/12)*t*(n^3-n)+n for t = 2, 4, 6, ... gives A004006, A006527, A006003, A005900, A004068, A000578, A004126, A000447, A004188, A004466, A004467, A007588, A062025, A063521, A063522, A063523.
For sums of cubes, cf. A000537 (partial sums), A003072, A003325, A024166, A024670, A101102 (fifth partial sums).
Cf. A001158 (inverse Möbius transform), A007412 (complement), A030078(n) (cubes of primes), A048766, A058645 (binomial transform), A065876, A101094, A101097.
Subsequence of A145784.
Cf. A260260 (comment). - Bruno Berselli, Jul 22 2015
Cf. A000292 (tetrahedral numbers), A005900 (octahedral numbers), A006566 (dodecahedral numbers), A006564 (icosahedral numbers).
Cf. A098737 (main diagonal).

a000578 = (^ 3)
a000578_list = 0 : 1 : 8 : zipWith (+)
   (map (+ 6) a000578_list)
   (map (* 3) $ tail $ zipWith (-) (tail a000578_list) a000578_list)
-- Reinhard Zumkeller, Sep 05 2015, May 24 2012, Oct 22 2011

[ n^3 : n in [0..50] ]; // Wesley Ivan Hurt, Jun 14 2014

I:=[0,1,8,27]; [n le 4 select I[n] else 4*Self(n-1)-6*Self(n-2)+4*Self(n-3)-Self(n-4): n in [1..45]]; // Vincenzo Librandi, Jul 05 2014

A000578 := n->n^3;
seq(A000578(n), n=0..50);
isA000578 := proc(r)
    local p;
    if r = 0 or r =1 then
        true;
    else
        for p in ifactors(r)[2] do
            if op(2, p) mod 3 <> 0 then
                return false;
            end if;
        end do:
        true ;
    end if;
end proc: # R. J. Mathar, Oct 08 2013

Table[n^3, {n, 0, 30}] (* Stefan Steinerberger, Apr 01 2006 *)
CoefficientList[Series[x (1 + 4 x + x^2)/(1 - x)^4, {x, 0, 45}], x] (* Vincenzo Librandi, Jul 05 2014 *)
Accumulate[Table[3n^2+3n+1,{n,0,20}]] (* or *) LinearRecurrence[{4,-6,4,-1},{1,8,27,64},20](* Harvey P. Dale, Aug 18 2018 *)

A000578(n):=n^3$
makelist(A000578(n),n,0,30); /* Martin Ettl, Nov 03 2012 */

A000578(n)=n^3 \\ M. F. Hasler, Apr 12 2008

is(n)=ispower(n,3) \\ Charles R Greathouse IV, Feb 20 2012

A000578_list, m = [], [6, -6, 1, 0]
for _ in range(10**2):
    A000578_list.append(m[-1])
    for i in range(3):
        m[i+1] += m[i] # Chai Wah Wu, Dec 15 2015

(define (A000578 n) (* n n n)) ;; Antti Karttunen, Oct 06 2017

a(n) = Sum_{i=0..n-1} A003215(i).
Multiplicative with a(p^e) = p^(3e). - David W. Wilson, Aug 01 2001
G.f.: x*(1+4*x+x^2)/(1-x)^4. - Simon Plouffe in his 1992 dissertation
Dirichlet generating function: zeta(s-3). - Franklin T. Adams-Watters, Sep 11 2005, Amarnath Murthy, Sep 09 2005
E.g.f.: (1+3*x+x^2)*x*exp(x). - Franklin T. Adams-Watters, Sep 11 2005 - Amarnath Murthy, Sep 09 2005
a(n) = Sum_{i=1..n} (Sum_{j=i..n+i-1} A002024(j,i)). - Reinhard Zumkeller, Jun 24 2007
a(n) = lcm(n, (n - 1)^2) - (n - 1)^2. E.g.: lcm(1, (1 - 1)^2) - (1 - 1)^2 = 0, lcm(2, (2 - 1)^2) - (2 - 1)^2 = 1, lcm(3, (3 - 1)^2) - (3 - 1)^2 = 8, ... - Mats Granvik, Sep 24 2007
Starting (1, 8, 27, 64, 125, ...), = binomial transform of [1, 7, 12, 6, 0, 0, 0, ...]. - Gary W. Adamson, Nov 21 2007
a(n) = A007531(n) + A000567(n). - Reinhard Zumkeller, Sep 18 2009
a(n) = binomial(n+2,3) + 4*binomial(n+1,3) + binomial(n,3). [Worpitzky's identity for cubes. See. e.g., Graham et al., eq. (6.37). - Wolfdieter Lang, Jul 17 2019]
a(n) = n + 6*binomial(n+1,3) = binomial(n,1)+6*binomial(n+1,3). - Ron Knott, Jun 10 2019
A010057(a(n)) = 1. - Reinhard Zumkeller, Oct 22 2011
a(n) = A000537(n) - A000537(n-1), difference between 2 squares of consecutive triangular numbers. - Pierre CAMI, Feb 20 2012
a(n) = A048395(n) - 2*A006002(n). - J. M. Bergot, Nov 25 2012
a(n) = 1 + 7*(n-1) + 6*(n-1)*(n-2) + (n-1)*(n-2)*(n-3). - Antonio Alberto Olivares, Apr 03 2013
a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3) + 6. - Ant King Apr 29 2013
a(n) = A000330(n) + Sum_{i=1..n-1} A014105(i), n >= 1. - Ivan N. Ianakiev, Sep 20 2013
a(k) = det(S(4,k,(1,1,-1))) = k*b(k)^2, where b(1)=1, b(2)=2, b(k) = 2*b(k-1) - b(k-2) = b(2)*b(k-1) - b(k-2). - Ryan Stees, Dec 14 2014
For n >= 1, a(n) = A152618(n-1) + A033996(n-1). - Bui Quang Tuan, Apr 01 2015
a(n) = 4*a(n-1) - 6*a(n-2) + 4*a(n-3) - a(n-4). - Jon Tavasanis, Feb 21 2016
a(n) = n + Sum_{j=0..n-1} Sum_{k=1..2} binomial(3,k)*j^(3-k). - Patrick J. McNab, Mar 28 2016
a(n) = A000292(n-1) * 6 + n. - Zhandos Mambetaliyev, Nov 24 2016
a(n) = n*binomial(n+1, 2) + 2*binomial(n+1, 3) + binomial(n,3). - Tony Foster III, Nov 14 2017
From Amiram Eldar, Jul 02 2020: (Start)
Sum_{n>=1} 1/a(n) = zeta(3) (A002117).
Sum_{n>=1} (-1)^(n+1)/a(n) = 3*zeta(3)/4 (A197070). (End)
From Amiram Eldar, Jan 20 2021: (Start)
Product_{n>=1} (1 + 1/a(n)) = cosh(sqrt(3)*Pi/2)/Pi.
Product_{n>=2} (1 - 1/a(n)) = cosh(sqrt(3)*Pi/2)/(3*Pi). (End)
a(n) = Sum_{d|n} sigma_3(d)*mu(n/d) = Sum_{d|n} A001158(d)*A008683(n/d). Moebius transform of sigma_3(n). - Ridouane Oudra, Apr 15 2021

A000035 Period 2: repeat [0, 1]; a(n) = n mod 2; parity of n.

Original entry on oeis.org

0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0

Offset: 0

N. J. A. Sloane

Least significant bit of n, lsb(n).
Also decimal expansion of 1/99.
Also the binary expansion of 1/3. - Robert G. Wilson v, Sep 01 2015
a(n) = A134451(n) mod 2. - Reinhard Zumkeller, Oct 27 2007 [Corrected by Jianing Song, Nov 22 2019]
Characteristic function of odd numbers: a(A005408(n)) = 1, a(A005843(n)) = 0. - Reinhard Zumkeller, Sep 29 2008
A102370(n) modulo 2. - Philippe Deléham, Apr 04 2009
Base b expansion of 1/(b^2-1) for any b >= 2 is 0.0101... (A005563 has b^2-1). - Rick L. Shepherd, Sep 27 2009
Let A be the Hessenberg n X n matrix defined by: A[1,j] = j mod 2, A[i,i] := 1, A[i,i-1] = -1, and A[i,j] = 0 otherwise. Then, for n >= 1, a(n) = (-1)^n*charpoly(A,1). - Milan Janjic, Jan 24 2010
From R. J. Mathar, Jul 15 2010: (Start)
The sequence is the principal Dirichlet character of the reduced residue system mod 2 or mod 4 or mod 8 or mod 16 ...
Associated Dirichlet L-functions are for example L(2,chi) = Sum_{n>=1} a(n)/n^2 == A111003,
or L(3,chi) = Sum_{n>=1} a(n)/n^3 = 1.05179979... = 7*A002117/8,
or L(4,chi) = Sum_{n>=1} a(n)/n^4 = 1.014678... = A092425/96. (End)
Also parity of the nonnegative integers A001477. - Omar E. Pol, Jan 17 2012
a(n) = (4/n), where (k/n) is the Kronecker symbol. See the Eric Weisstein link. - Wolfdieter Lang, May 28 2013
Also the inverse binomial transform of A131577. - Paul Curtz, Nov 16 2016 [an observation forwarded by Jean-François Alcover]
The emanation sequence for the globe category. That is take the globe category, take the corresponding polynomial comonad, consider its carrier polynomial as a generating function, and take the corresponding sequence. - David Spivak, Sep 25 2020
For n > 0, a(n) is the alternating sum of the product of n increasing and n decreasing odd factors. For example, a(4) = 1*7 - 3*5 + 5*3 - 7*1 and a(5) = 1*9 - 3*7 + 5*5 - 7*3 + 9*1. - Charlie Marion, Mar 24 2022

			G.f. = x + x^3 + x^5 + x^7 + x^9 + x^11 + x^13 + x^15 + ... - _Michael Somos_, Feb 20 2024

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

David Wasserman, Table of n, a(n) for n = 0..1000
Paul Barry, A Catalan Transform and Related Transformations on Integer Sequences, Journal of Integer Sequences, Vol. 8 (2005), Article 05.4.5.
F. Javier de Vega, An extension of Furstenberg's theorem of the infinitude of primes, arXiv:2003.13378 [math.NT], 2020.
Clark Kimberling, A Combinatorial Classification of Triangle Centers on the Line at Infinity, J. Int. Seq., Vol. 22 (2019), Article 19.5.4.
Y. Puri and T. Ward, Arithmetic and growth of periodic orbits, J. Integer Seqs., Vol. 4 (2001), #01.2.1.
Eric Weisstein's World of Mathematics, Dirichlet Series Generating Function
Eric Weisstein's World of Mathematics, Kronecker Symbol
A. K. Whitford, Binet's Formula Generalized, Fibonacci Quarterly, Vol. 15, No. 1, 1979, pp. 21, 24, 29
Index entries for "core" sequences
Index entries for sequences that are fixed points of mappings
Index entries for characteristic functions
Index entries for linear recurrences with constant coefficients, signature (0,1).

Ones complement of A059841.
Cf. A053644 for most significant bit.
This is Guy Steele's sequence GS(1, 2) (see A135416).
Period k zigzag sequences: this sequence (k=2), A007877 (k=4), A260686 (k=6), A266313 (k=8), A271751 (k=10), A271832 (k=12), A279313 (k=14), A279319 (k=16), A158289 (k=18).
Cf. A154955 (Mobius transform), A131577 (binomial transform).
Cf. A111003 (Dgf at s=2), A233091 (Dgf at s=3), A300707 (Dgf at s=4).
Parity of A005811.

a000035 n = n `mod` 2  -- James Spahlinger, Oct 08 2012

a000035_list = cycle [0,1]  -- Reinhard Zumkeller, Jan 06 2012

A000035 := n->n mod 2;
[ seq(i mod 2, i=0..100) ];

PadLeft[{},110,{0,1}] (* Harvey P. Dale, Sep 25 2011 *)

A000035(n):=mod(n,2)$
makelist(A000035(n),n,0,30); /* Martin Ettl, Nov 12 2012 */

PARI
```
a(n)=n%2;
```

a(n)=direuler(p=1,100,if(p==2,1,1/(1-X)))[n] /* Ralf Stephan, Mar 27 2015 */

def A000035(n): return n & 1 # Chai Wah Wu, May 25 2022

(define (A000035 n) (mod n 2)) ;; For R6RS. Use modulo in older Schemes like MIT/GNU Scheme. - Antti Karttunen, Mar 21 2017

a(n) = (1 - (-1)^n)/2.
a(n) = n mod 2.
a(n) = 1 - a(n-1).
Multiplicative with a(p^e) = p mod 2. - David W. Wilson, Aug 01 2001
G.f.: x/(1-x^2). E.g.f.: sinh(x). - Paul Barry, Mar 11 2003
a(n) = (A000051(n) - A014551(n))/2. - Mario Catalani (mario.catalani(AT)unito.it), Aug 30 2003
a(n) = ceiling((-2)^(-n-1)). - Reinhard Zumkeller, Apr 19 2005
Dirichlet g.f.: (1-1/2^s)*zeta(s). - R. J. Mathar, Mar 04 2011
a(n) = ceiling(n/2) - floor(n/2). - Arkadiusz Wesolowski, Sep 16 2012
a(n) = ceiling( cos(Pi*(n-1))/2 ). - Wesley Ivan Hurt, Jun 16 2013
a(n) = floor((n-1)/2) - floor((n-2)/2). - Mikael Aaltonen, Feb 26 2015
Dirichlet g.f.: L(chi(2),s) with chi(2) the principal Dirichlet character modulo 2. - Ralf Stephan, Mar 27 2015
a(n) = 0^^n = 0^(0^(0...)) (n times), where we take 0^0 to be 1. - Natan Arie Consigli, May 02 2015
Euler transform and inverse Moebius transform of length 2 sequence [0, 1]. - Michael Somos, Feb 20 2024

A013661 Decimal expansion of Pi^2/6 = zeta(2) = Sum_{m>=1} 1/m^2.

Original entry on oeis.org

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

Offset: 1

N. J. A. Sloane

"In 1736 he [Leonard Euler, 1707-1783] discovered the limit to the infinite series, Sum 1/n^2. He did it by doing some rather ingenious mathematics using trigonometric functions that proved the series summed to exactly Pi^2/6. How can this be? ... This demonstrates one of the most startling characteristics of mathematics - the interconnectedness of, seemingly, unrelated ideas." - Clawson [See Hardy and Wright, Theorems 332 and 333. - N. J. A. Sloane, Jan 20 2017]
Also dilogarithm(1). - Rick L. Shepherd, Jul 21 2004
Also Integral_{x>=0} x/(exp(x)-1) dx. [Abramowitz-Stegun, 23.2.7., for s=2, p. 807]
For the partial sums see the fractional sequence A007406/A007407.
Pi^2/6 is also the length of the circumference of a circle whose diameter equals the ratio of volume of an ellipsoid to the circumscribed cuboid. Pi^2/6 is also the length of the circumference of a circle whose diameter equals the ratio of surface area of a sphere to the circumscribed cube. - Omar E. Pol, Oct 07 2011
1 < n^2/(eulerphi(n)*sigma(n)) < zeta(2) for n > 1. - Arkadiusz Wesolowski, Sep 04 2012
Volume of a sphere inscribed in a cube of volume Pi. More generally, Pi^x/6 is the volume of an ellipsoid inscribed in a cuboid of volume Pi^(x-1). - Omar E. Pol, Feb 17 2016
Surface area of a sphere inscribed in a cube of surface area Pi. More generally, Pi^x/6 is the surface area of a sphere inscribed in a cube of surface area Pi^(x-1). - Omar E. Pol, Feb 19 2016
zeta(2)+1 is a weighted average of the integers, n > 2, using zeta(n)-1 as the weights for each n. We have: Sum_{n >= 2} (zeta(n)-1) = 1 and Sum_{n >= 2} n*(zeta(n)-1) = zeta(2)+1. - Richard R. Forberg, Jul 14 2016
zeta(2) is the expected value of sigma(n)/n. - Charlie Neder, Oct 22 2018
Graham shows that a rational number x can be expressed as a finite sum of reciprocals of distinct squares if and only if x is in [0, Pi^2/6-1) U [1, Pi^2/6). See section 4 for other results and Theorem 5 for the underlying principle. - Charles R Greathouse IV, Aug 04 2020
From Peter Bala, Aug 24 2025: (Start)
By definition, zeta(2) = lim_{n -> oo} s(n), where s(n) = Sum_{k = 1..n} 1/k^2. The convergence is slow. For example, s(50) = 1.6(25...) is only correct to 1 decimal digit.
Let S(n) = Sum_{k = 0..n} (-1)^(n+k)*binomial(n, k)*binomial(n+k, k)*s(n+k). It appears that S(n) converges to zeta(2) much more rapidly. For example, S(50) = 1.64493406684822643647241516664602(137...) gives zeta(2) correct to 32 decimal digits. Cf. A073004. (End)

			1.6449340668482264364724151666460251892189499012067984377355582293700074704032...

M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards Applied Math. Series 55, 1964 (and various reprintings), p. 811.
F. Aubonnet, D. Guinin and B. Joppin, Précis de Mathématiques, Analyse 2, Classes Préparatoires, Premier Cycle Universitaire, Bréal, 1990, Exercice 908, pages 82 and 91-92.
Calvin C. Clawson, Mathematical Mysteries, The Beauty and Magic of Numbers, Perseus Books, 1996, p. 97.
John H. Conway and Richard K. Guy, The Book of Numbers, New York: Springer-Verlag, 1996. See p. 262.
W. Dunham, Euler: The Master of Us All, The Mathematical Association of America, Washington, D.C., 1999, p. xxii.
Steven R. Finch, Mathematical Constants, Encyclopedia of Mathematics and its Applications, vol. 94, Cambridge University Press, 2003, Sections 1.4.1 and 5.16, pp. 20, 365.
Hardy and Wright, 'An Introduction to the Theory of Numbers'. See Theorems 332 and 333.
A. A. Markoff, Mémoire sur la transformation de séries peu convergentes en séries très convergentes, Mém. de l'Acad. Imp. Sci. de St. Pétersbourg, XXXVII, 1890.
Paulo Ribenboim, The Little Book of Bigger Primes, Springer-Verlag NY 2004. See pp. 10, 161-162.
G. F. Simmons, Calculus Gems, Section B.15, B.24, pp. 270-271, 323-325, McGraw Hill, 1992.
Arnold Walfisz, Weylsche Exponentialsummen in der neueren Zahlentheorie, Deutscher Verlag der Wissenschaften, Berlin, 1963, p. 99, Satz 1.
A. Weil, Number theory: an approach through history; from Hammurapi to Legendre, Birkhäuser, Boston, 1984; see p. 261.
David Wells, The Penguin Dictionary of Curious and Interesting Numbers, Revised Edition, Penguin Books, London, England, 1997, page 23.

Harry J. Smith, Table of n, a(n) for n = 1..20000
M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards, Applied Math. Series 55, Tenth Printing, 1972 [alternative scanned copy].
D. H. Bailey, J. M. Borwein, and D. M. Bradley, Experimental determination of Apéry-like identities for zeta(4n+2), arXiv:math/0505270 [math.NT], 2005-2006.
Peter Bala, New series for old functions.
Peter Bala, Formulas for A013661.
David Benko and John Molokach, The Basel Problem as a Rearrangement of Series, The College Mathematics Journal, Vol. 44, No. 3 (May 2013), pp. 171-176.
R. Calinger, Leonhard Euler: The First St. Petersburg Years (1727-1741), Historia Mathematica, Vol. 23, 1996, pp. 121-166.
Robin Chapman, Evaluating Zeta(2).
R. W. Clickery, Probability of two numbers being coprime.
Alessio Del Vigna, On a solution to the Basel problem based on the fundamental theorem of calculus, arXiv:2104.01710 [math.HO], 2021.
Leonhard Euler, On the sums of series of reciprocals, arXiv:math/0506415 [math.HO], 2005-2008.
Leonhard Euler, De summis serierum reciprocarum, E41.
R. L. Graham, On finite sums of unit fractions, Proceedings of the London Mathematical Society, s3-14 (1964), pp. 193-207. doi:10.1112/plms/s3-14.2.193
Michael D. Hirschhorn, A simple proof that zeta(2) = Pi^2/6, The Mathematical Intelligencer 33:3 (2011), pp 81-82.
Melissa Larson, Verifying and discovering BBP-type formulas, 2008.
Alain Lasjaunias and Jean-Paul Tran, A note on the equality Pi^2/6 = Sum_{n>=1} 1/n^2, arXiv:2312.02245 [math.HO], 2023.
Math. Reference Project, The Zeta Function, Zeta(2).
Math. Reference Project, The Zeta Function, Odds That Two Numbers Are Coprime".
Romeo Mestrovic, Euclid's theorem on the infinitude of primes: a historical survey of its proofs (300 BC--2012) and another new proof, arXiv preprint arXiv:1202.3670 [math.HO], 2012.
Jon Perry, Prime Product Paradox
Simon Plouffe, Plouffe's Inverter, Zeta(2) or Pi**2/6 to 100000 digits.
Simon Plouffe, Zeta(2) or Pi**2/6 to 10000 places.
Simon Plouffe, Zeta(2) to Zeta(4096) to 2048 digits each (gzipped file)
A. L. Robledo, value of the Riemann zeta function at s=2, PlanetMath.org.
E. Sandifer, How Euler Did It, Estimating the Basel Problem.
E. Sandifer, How Euler Did It, Basel Problem with Integrals.
C. Tooth, Pi squared over six.
Eric Weisstein's World of Mathematics, Dilogarithm.
Eric Weisstein's World of Mathematics, Riemann Zeta Function zeta(2).
Wikipedia, Basel Problem.
Wikipedia, Bailey-Borwein-Plouffe formula.
Herbert S. Wilf, Accelerated series for universal constants, by the WZ method, Discrete Mathematics & Theoretical Computer Science, Vol 3, No 4 (1999).
Index entries for transcendental numbers.
Index entries for zeta function.

Cf. A001008 (H(n): numerators), A002805 (denominators), A013679 (continued fraction), A002117 (zeta(3)), A013631 (cont.frac. for zeta(3)), A013680 (cont.frac. for zeta(4)), 1/A059956, A108625, A142995, A142999.

Cf. A000290.

pi:=Pi(RealField(110)); Reverse(Intseq(Floor(10^105*pi^2/6))); // Vincenzo Librandi, Oct 13 2015

evalf(Pi^2/6,120); # Muniru A Asiru, Oct 25 2018
# Calculates an approximation with n exact decimal places (small deviation
# in the last digits are possible). Goes back to ideas of A. A. Markoff 1890.
zeta2 := proc(n) local q, s, w, v, k; q := 0; s := 0; w := 1; v := 4;
for k from 2 by 2 to 7*n/2 do
    w := w*v/k;
    q := q + v;
    v := v + 8;
    s := s + 1/(w*q);
od; 12*s; evalf[n](%) end:
zeta2(1000); # Peter Luschny, Jun 10 2020

RealDigits[N[Pi^2/6, 100]][[1]]
RealDigits[Zeta[2],10,120][[1]] (* Harvey P. Dale, Jan 08 2021 *)

fpprec : 100$ ev(bfloat(zeta(2)))$ bfloat(%); /* Martin Ettl, Oct 21 2012 */

PARI
```
default(realprecision, 200); Pi^2/6
```
PARI
```
default(realprecision, 200); dilog(1)
```
PARI
```
default(realprecision, 200); zeta(2)
```

A013661(n)={localprec(n+2); Pi^2/.6\10^n%10} \\ Corrected and improved by M. F. Hasler, Apr 20 2021

default(realprecision, 20080); x=Pi^2/6; for (n=1, 20000, d=floor(x); x=(x-d)*10; write("b013661.txt", n, " ", d)); \\ Harry J. Smith, Apr 29 2009

sumnumrat(1/x^2, 1) \\ Charles R Greathouse IV, Jan 20 2022

# Use some guard digits when computing.
# BBP formula (3 / 16) P(2, 64, 6, (16, -24, -8, -6,  1, 0)).
from decimal import Decimal as dec, getcontext
def BBPzeta2(n: int) -> dec:
    getcontext().prec = n
    s = dec(0); f = dec(1); g = dec(64)
    for k in range(int(n * 0.5536546824812272) + 1):
        sixk = dec(6 * k)
        s += f * ( dec(16) / (sixk + 1) ** 2 - dec(24) / (sixk + 2) ** 2
                 - dec(8)  / (sixk + 3) ** 2 - dec(6)  / (sixk + 4) ** 2
                 + dec(1)  / (sixk + 5) ** 2 )
        f /= g
    return (s * dec(3)) / dec(16)
print(BBPzeta2(2000))  # Peter Luschny, Nov 01 2023

Limit_{n->oo} (1/n)*(Sum_{k=1..n} frac((n/k)^(1/2))) = zeta(2) and in general we have lim_{n->oo} (1/n)*(Sum_{k=1..n} frac((n/k)^(1/m))) = zeta(m), m >= 2. - Yalcin Aktar, Jul 14 2005
Equals Integral_{x=0..1} (log(x)/(x-1)) dx or Integral_{x>=1} (log(x/(x-1))/x) dx. - Jean-François Alcover, May 30 2013
For s >= 2 (including Complex), zeta(s) = Product_{n >= 1} prime(n)^s/(prime(n)^s - 1). - Fred Daniel Kline, Apr 10 2014
Also equals 1 + Sum_{n>=0} (-1)^n*StieltjesGamma(n)/n!. - Jean-François Alcover, May 07 2014
zeta(2) = Sum_{n>=1} ((floor(sqrt(n)) - floor(sqrt(n-1)))/n). - Mikael Aaltonen, Jan 10 2015
zeta(2) = Sum_{n>=1} (((sqrt(5)-1)/2/sqrt(5))^n/n^2) + Sum_{n>=1} (((sqrt(5)+1)/2/sqrt(5))^n/ n^2) + log((sqrt(5)-1)/2/sqrt(5))log((sqrt(5)+1)/2/sqrt(5)). - Seiichi Kirikami, Oct 14 2015
The above formula can also be written zeta(2) = dilog(x) + dilog(y) + log(x)*log(y) where x = (1-1/sqrt(5))/2 and y=(1+1/sqrt(5))/2. - Peter Luschny, Oct 16 2015
zeta(2) = Integral_{x>=0} 1/(1 + e^x^(1/2)) dx, because (1 - 1/2^(s-1))*Gamma[1 + s]*Zeta[s] = Integral_{x>=0} 1/(1 + e^x^(1/s)) dx. After Jean-François Alcover in A002162. - Mats Granvik, Sep 12 2016
zeta(2) = Product_{n >= 1} (144*n^4)/(144*n^4 - 40*n^2 + 1). - Fred Daniel Kline, Oct 29 2016
zeta(2) = lim_{n->oo} (1/n) * Sum_{k=1..n} A017665(k)/A017666(k). - Dimitri Papadopoulos, May 10 2019 [See the Walfisz reference, and a comment in A284648, citing also the Sándor et al. Handbook. - Wolfdieter Lang, Aug 22 2019]
Equals Sum_{k>=1} H(k)/(k*(k+1)), where H(k) = A001008(k)/A002805(k) is the k-th harmonic number. - Amiram Eldar, Aug 16 2020
Equals (8/3)*(1/2)!^4 = (8/3)*Gamma(3/2)^4. - Gary W. Adamson, Aug 17 2021
Equals ((m+1)/m) * Integral_{x=0..1} log(Sum {k=0..m} x^k )/x dx, m > 0 (Aubonnet reference). - _Bernard Schott, Feb 11 2022
Equals 1 + Sum_{n>=1} n*(zeta(n+2)-1). - Richard R. Forberg, Jun 04 2023; improved by Natalia L. Skirrow, Jul 25 2025
Equals Psi'(1) where Psi'(x) is the trigamma function (by Abramowitz Stegun 6.4.2). - Andrea Pinos, Oct 22 2024
Equals Integral_{x=0..1} Integral_{y=0..1} 1/(1 - x*y) dy dx. - Kritsada Moomuang, May 22 2025
Equals 1 + Sum_{n>=1} 1/(n^2*(n+1)). - Natalia L. Skirrow, Jul 25 2025

Edited by N. J. A. Sloane, Nov 22 2023

A002162 Decimal expansion of the natural logarithm of 2.

Original entry on oeis.org

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

Offset: 0

N. J. A. Sloane

Newton calculated the first 16 terms of this sequence.
Area bounded by y = tan x, y = cot x, y = 0. - Clark Kimberling, Jun 26 2020
Choose four values independently and uniformly at random from the unit interval [0,1]. Sort them, and label them a,b,c,d from least to greatest (so that a b^2+c^2. - Akiva Weinberger, Dec 02 2024
Define the trihyperboloid to be the intersection of the three solid hyperboloids x^2+y^2-z^2<1, x^2-y^2+z^2<1, and -x^2+y^2+z^2<1. This fits perfectly within the cube [-1,1]^3. Then this is the ratio of the volume of the trihyperboloid to its bounding cube. - Akiva Weinberger, Dec 02 2024

			0.693147180559945309417232121458176568075500134360255254120680009493393...

G. Boros and V. H. Moll, Irresistible Integrals: Symbolics, Analysis and Experiments in the Evaluation of Integrals, Cambridge University Press, 2004.
Calvin C. Clawson, Mathematical Mysteries: The Beauty and Magic of Numbers, Springer, 2013. See p. 227.
John H. Conway and Richard K. Guy, The Book of Numbers, New York: Springer-Verlag, 1996. See pp. 24, 250.
Steven R. Finch, Mathematical Constants, Cambridge, 2003, Sections 1.3.3, 2.21, 6.2, and 7.2.
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).
Jerome Spanier and Keith B. Oldham, "Atlas of Functions", Hemisphere Publishing Corp., 1987, chapter 25 and appendix A, equations 25:14:3 and A:7:3 at pages 232, 670.
David Wells, The Penguin Dictionary of Curious and Interesting Numbers. Penguin Books, NY, 1986, Revised edition 1987, p. 29.

Harry J. Smith, Table of n, a(n) for n = 0..20000
D. H. Bailey and J. M. Borwein, Experimental Mathematics: Examples, Methods and Implications, Notices of the AMS, May 2005, Volume 52, Issue 5.
Peter Bala, New series for old functions
J. M. Borwein, P. B. Borwein, and K. Dilcher, Pi, Euler numbers and asymptotic expansions, Amer. Math. Monthly, 96 (1989), 681-687.
Paul Cooijmans, Odds.
X. Gourdon and P. Sebah, The logarithm constant:log(2), 2001.
X. Gourdon and P. Sebah, The logarithm constant:log(2), 2004. (Revised and extended version of above article.)
M. Kontsevich and D. Zagier, Periods, pp. 4-5.
Mathematical Reflections, Solution to Problem U376, Issue 4, 2016, p 17.
Isaac Newton, The method of fluxions and infinite series; with its application to the geometry of curve-lines, 1736; see p. 96.
Michael Penn, an alternating floor sum., YouTube video, 2020.
Michael Penn, A wonderful limit from the 2011 Virginia Tech Regional Math Competition, YouTube video, 2022.
Simon Plouffe, log(2), natural logarithm of 2 to 2000 places.
S. Ramanujan, Question 260, J. Ind. Math. Soc., III, p. 43.
Albert Stadler, Problem 3567, Crux Mathematicorum, Vol. 36 (Oct. 2010), p. 396; Oliver Geupel, Solution, Crux Mathematicorum, Vol. 37 (Oct. 2011), pp. 400-401.
D. W. Sweeney, On the computation of Euler's constant, Math. Comp., 17 (1963), 170-178.
Horace S. Uhler, Recalculation and extension of the modulus and of the logarithms of 2, 3, 5, 7 and 17, Proc. Nat. Acad. Sci. U. S. A. 26, (1940). 205-212.
Eric Weisstein's World of Mathematics, Natural Logarithm of 2, Masser-Gramain Constant, Logarithmic Integral, Dirichlet Eta Function.
Wikipedia, Natural logarithm of 2.
Wikipedia, Period (algebraic geometry).
Index entries for transcendental numbers.

Cf. A016730 (continued fraction), A002939, A008288, A142979, A142992.

RealDigits[N[Log[2],200]][[1]] (* Vladimir Joseph Stephan Orlovsky, Feb 21 2011 *)
RealDigits[Log[2],10,120][[1]] (* Harvey P. Dale, Jan 25 2024 *)

{ default(realprecision, 20080); x=10*log(2); for (n=0, 20000, d=floor(x); x=(x-d)*10; write("b002162.txt", n, " ", d)); } \\ Harry J. Smith, Apr 21 2009

log(2) = Sum_{k>=1} 1/(k*2^k) = Sum_{j>=1} (-1)^(j+1)/j.
log(2) = Integral_{t=0..1} dt/(1+t).
log(2) = (2/3) * (1 + Sum_{k>=1} 2/((4*k)^3-4*k)) (Ramanujan).
log(2) = 4*Sum_{k>=0} (3-2*sqrt(2))^(2*k+1)/(2*k+1) (Y. Luke). - R. J. Mathar, Jul 13 2006
log(2) = 1 - (1/2)*Sum_{k>=1} 1/(k*(2*k+1)). - Jaume Oliver Lafont, Jan 06 2009, Jan 08 2009
log(2) = 4*Sum_{k>=0} 1/((4*k+1)*(4*k+2)*(4*k+3)). - Jaume Oliver Lafont, Jan 08 2009
log(2) = 7/12 + 24*Sum_{k>=1} 1/(A052787(k+4)*A000079(k)). - R. J. Mathar, Jan 23 2009
From Alexander R. Povolotsky, Jul 04 2009: (Start)
log(2) = (1/4)*(3 - Sum_{n>=1} 1/(n*(n+1)*(2*n+1))).
log(2) = (230166911/9240 - Sum_{k>=1} (1/2)^k*(11/k + 10/(k+1) + 9/(k+2) + 8/(k+3) + 7/(k+4) + 6/(k+5) - 6/(k+7) - 7/(k+8) - 8/(k+9) - 9/(k+10) - 10/(k+11)))/35917. (End)
log(2) = A052882/A000670. - Mats Granvik, Aug 10 2009
From log(1-x-x^2) at x=1/2, log(2) = (1/2)*Sum_{k>=1} L(k)/(k*2^k), where L(n) is the n-th Lucas number (A000032). - Jaume Oliver Lafont, Oct 24 2009
log(2) = Sum_{k>=1} 1/(cos(k*Pi/3)*k*2^k) (cf. A176900). - Jaume Oliver Lafont, Apr 29 2010
log(2) = (Sum_{n>=1} 1/(n^2*(n+1)^2*(2*n+1)) + 11)/16. - Alexander R. Povolotsky, Jan 13 2011
log(2) = ((Sum_{n>=1} (2*n+1)/(Sum_{k=1..n} k^2)^2)+396)/576. - Alexander R. Povolotsky, Jan 14 2011
From Alexander R. Povolotsky, Dec 16 2008: (Start)
log(2) = 105*(319/44100 - Sum_{n>=1} 1/(2*n*(2*n+1)*(2*n+3)*(2*n+5)*(2*n+7))).
log(2) = 319/420 - (3/2)*Sum_{n>=1} 1/(6*n^2+39*n+63). (End)
log(2) = Sum_{k>=1} A191907(2,k)/k. - Mats Granvik, Jun 19 2011
log(2) = Integral_{x=0..oo} 1/(1 + e^x) dx. - Jean-François Alcover, Mar 21 2013
log(2) = lim_{s->1} zeta(s)*(1-1/2^(s-1)). - Mats Granvik, Jun 18 2013
From Peter Bala, Dec 10 2013: (Start)
log(2) = 2*Sum_{n>=1} 1/( n*A008288(n-1,n-1)*A008288(n,n) ), a result due to Burnside.
log(2) = (1/3)*Sum_{n >= 0} (5*n+4)/( (3*n+1)*(3*n+2)*C(3*n,n) )*(1/2)^n = (1/12)*Sum_{n >= 0} (28*n+17)/( (3*n+1)*(3*n+2)*C(3*n,n) )*(-1/4)^n.
log(2) = (3/16)*Sum_{n >= 0} (14*n+11)/( (4*n+1)*(4*n+3)*C(4*n,2*n) )*(1/4)^n = (1/12)*Sum_{n >= 0} (34*n+25)/( (4*n+1)*(4*n+3)*C(4*n,2*n) )*(-1/18)^n. For more series of this type see the Bala link.
See A142979 for series acceleration formulas for log(2) obtained from the Mercator series log(2) = Sum_{n >= 1} (-1)^(n+1)/n. See A142992 for series for log(2) related to the root lattice C_n. (End)
log(2) = lim_{n->oo} Sum_{k=2^n..2^(n+1)-1} 1/k. - Richard R. Forberg, Aug 16 2014
From Peter Bala, Feb 03 2015: (Start)
log(2) = (2/3)*Sum_{k >= 0} 1/((2*k + 1)*9^k).
Define a pair of integer sequences A(n) = 9^n*(2*n + 1)!/n! and B(n) = A(n)*Sum_{k = 0..n} 1/((2*k + 1)*9^k). Both satisfy the same second-order recurrence equation u(n) = (40*n + 16)*u(n-1) - 36*(2*n - 1)^2*u(n-2). From this observation we obtain the continued fraction expansion log(2) = (2/3)*(1 + 2/(54 - 36*3^2/(96 - 36*5^2/(136 - ... - 36*(2*n - 1)^2/((40*n + 16) - ... ))))). Cf. A002391, A073000 and A105531 for similar expansions. (End)
log(2) = Sum_{n>=1} (Zeta(2*n)-1)/n. - Vaclav Kotesovec, Dec 11 2015
From Peter Bala, Oct 30 2016: (Start)
Asymptotic expansions:
for N even, log(2) - Sum_{k = 1..N/2} (-1)^(k-1)/k ~ (-1)^(N/2)*(1/N - 1/N^2 + 2/N^4 - 16/N^6 + 272/N^8 - ...), where the sequence of unsigned coefficients [1, 1, 2, 16, 272, ...] is A000182 with an extra initial term of 1. See Borwein et al., Theorem 1 (b);
for N odd, log(2) - Sum_{k = 1..(N-1)/2} (-1)^(k-1)/k ~ (-1)^((N-1)/2)*(1/N - 1/N^3 + 5/N^5 - 61/N^7 + 1385/N^9 - ...), by Borwein et al., Lemma 2 with f(x) := 1/(x + 1/2), h := 1/2 and then set x = (N - 1)/2, where the sequence of unsigned coefficients [1, 1, 5, 61, 1385, ...] is A000364. (End)
log(2) = lim_{n->oo} Sum_{k=1..n} sin(1/(n+k)). See Mathematical Reflections link. - Michel Marcus, Jan 07 2017
log(2) = Sum_{n>=1} A006519(n) / ((1 + 2^A006519(n)) * A000265(n) * (1 + A000265(n))). - Nicolas Nagel, Mar 19 2018
From Amiram Eldar, Jul 02 2020: (Start)
Equals Sum_{k>=2} zeta(k)/2^k.
Equals -Sum_{k>=2} log(1 - 1/k^2).
Equals Sum_{k>=1} 1/A002939(k).
Equals Integral_{x=0..Pi/3} tan(x) dx. (End)
log(2) = Integral_{x=0..Pi/2} (sec(x) - tan(x)) dx. - Clark Kimberling, Jul 08 2020
From Peter Bala, Nov 14 2020: (Start)
log(2) = Integral_{x = 0..1} (x - 1)/log(x) dx (Boros and Moll, p. 97).
log(2) = (1/2)*Integral_{x = 0..1} (x + 2)*(x - 1)^2/log(x)^2 dx.
log(2) = (1/4)*Integral_{x = 0..1} (x^2 + 3*x + 4)*(x - 1)^3/log(x)^3 dx. (End)
log(2) = 2*arcsinh(sqrt(2)/4) = 2*sqrt(2)*Sum_{n >= 0} (-1)^n*C(2*n,n)/ ((8*n+4)*32^n) = 3*Sum_{n >= 0} (-1)^n/((8*n+4)*(2^n)*C(2*n,n)). - Peter Bala, Jan 14 2022
log(2) = Integral_{x=0..oo} ( e^(-x) * (1-e^(-2x)) * (1-e^(-4x)) * (1-e^(-6x)) ) / ( x * (1-e^(-14x)) ) dx (see Crux Mathematicorum link). - Bernard Schott, Jul 11 2022
From Peter Bala, Oct 22 2023: (Start)
log(2) = 23/32 + 2!^3/16 * Sum_{n >= 1} (-1)^n * (n + 1)/(n*(n + 1)*(n + 2))^2 = 707/1024 - 4!^3/(16^2 * 2!^2) * Sum_{n >= 1} (-1)^n * (n + 2)/(n*(n + 1)*(n + 2)*(n + 3)*(n + 4))^2 = 42611/61440 + 6!^3/(16^3 * 3!^2) * Sum_{n >= 1} (-1)^n * (n + 3)/(n*(n + 1)*(n + 2)*(n + 3)*(n + 4)*(n + 5)*(n + 6))^2.
More generally, it appears that for k >= 0, log(2) = c(k) + (2*k)!^3/(16^k * k!^2) * Sum_{n >= 1} (-1)^(n+k+1) * (n + k)/(n*(n + 1)*...*(n + 2*k))^2 , where c(k) is a rational approximation to log(2). The first few values of c(k) are [0, 23/32, 707/1024, 42611/61440, 38154331/55050240, 76317139/110100480, 26863086823/38755368960, ...].
Let P(n,k) = n*(n + 1)*...*(n + k).
Conjecture: for k >= 0 and r even with r - 1 <= k, the series Sum_{n >= 1} (-1)^n * (d/dn)^r (P(n,k)) / (P(n,k)^2  = A(r,k)*log(2) + B(r,k), where A(r,k) and B(r,k) are both rational numbers. (End)
From Peter Bala, Nov 13 2023: (Start)
log(2) = 5/8 + (1/8)*Sum_{k >= 1} (-1)^(k+1) * (2*k + 1)^2 / ( k*(k + 1) )^4
  = 257/384 + (3!^5/2^9)*Sum_{k >= 1} (-1)^(k+1) * (2*k + 1)*(2*k + 3)^2*(2*k + 5) / ( k*(k + 1)*(k + 2)*(k + 3) )^4
  = 267515/393216 + (5!^5/2^19)*Sum_{k >= 1} (-1)^(k+1) * (2*k + 1)*(2*k + 3)*(2*k + 5)^2*(2*k + 7)*(2*k + 9) / ( k*(k + 1)*(k + 2)*(k + 3)*(k + 4)*(k + 5) )^4
log(2) = 3/4 - 1/128 * Sum_{k >= 0} (-1/16)^k * (10*k + 12)*binomial(2*k+2,k+1)/ ((k + 1)*(2*k + 3)). The terms of the series are O(1/(k^(3/2)*4^n)). (End)
log(2) = eta(1) is a period, where eta(x) is the Dirichlet eta function. - Andrea Pinos, Mar 19 2024
log(2) = K_{n>=0} (n^2 + [n=0])/1, where K is the Gauss notation for an infinite continued fraction. In the expanded form, log(2) = 1/(1 + 1/(1 + 4/(1 + 9/1 + 16/(1 + 25/(1 + ... (see Clawson at p. 227). - Stefano Spezia, Jul 01 2024
log(2) = lim_{n->oo} Sum_{k=1..n} 1/(n + k) = lim_{x->0} (2^x - 1)/x = lim_{x->0} (2^x - 2^(-x))/(2*x) (see Finch). - Stefano Spezia, Oct 19 2024
From Colin Linzer, Nov 08 2024: (Start)
log(2) = Integral_{t=0...oo} (1 - tanh(t)) dt.
log(2) = Integral_{t=0...1} arctanh(t) dt.
log(2) = (1/2) * Integral_{t=-1...1} |arctanh(t)| dt. (End)
log(2) = 1 + Sum_{n >= 1} (-1)^n/(n*(4*n^2 - 1)) = 1/2 + (1/2)*Sum_{n >= 1} 1/(n*(4*n^2 - 1)). - Peter Bala, Jan 07 2025
log(2) = Integral_{x=0..1} Integral_{y=0..1} 1/((1 - x*y)*(1 + x)*(1 + y)) dy dx. - Kritsada Moomuang, May 22 2025

A006752 Decimal expansion of Catalan's constant 1 - 1/9 + 1/25 - 1/49 + 1/81 - ...

Original entry on oeis.org

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

Offset: 0

N. J. A. Sloane

Usually denoted by G.

With the k-th appended term being 2*3*...*(2+k-2)*2^k*(2^k-1)*Bern(k) / (2*k!*(J^(k+2-1))). Bern(k) is a Bernoulli number and J is a large number of the form 4n + 1. See equation 3:3:7 in Spanier and Oldham. - Harry J. Smith, May 07 2009

			0.91596559417721901505460351493238411077414937428167213426649811962176301977...

Miklos Bona, editor, Handbook of Enumerative Combinatorics, CRC Press, 2015, pages 57, 554.
Steven R. Finch, Mathematical Constants, Encyclopedia of Mathematics and its Applications, vol. 94, Cambridge University Press, pp. 53-59.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
Jerome Spanier and Keith B. Oldham, An Atlas of Functions, 1987, equations 1:7:3, 3:3:7.

Harry J. Smith, Table of n, a(n) for n = 0..20000
Milton Abramowitz and Irene A. Stegun, editors, Catalan's constant, Handbook of Mathematical Functions, December 1972, p. 807, 23.2.21 for n=2.
Victor Adamchik, 33 representations for Catalan's constant.
David H. Bailey, Jonathan M. Borwein, Andrew Mattingly, and Glenn Wightwick, The Computation of Previously Inaccessible Digits of Pi^2 and Catalan's Constant, Notices AMS, 60 (No. 7 2013), 844-854.
Peter Bala, New series for old functions.
David M. Bradley, Representations of Catalan's constant, 2001.
Eugène-Charles Catalan, Mémoire sur la transformation des séries et sur quelques intégrales définies, Mémoires de l'Académie royale de Belgique, 1867, Vol. 33, pp. 1-50.
Sarth Chavan and Christophe Vignat, A Triple Integral representation of Catalan's constant, arXiv:2105.11771 [math.NT], 2021.
Greg Fee, Catalan's Constant to 300000 digits, Project Gutenberg, 1996.
G. J. Fee, Computation of Catalan's constant using Ramanujan's formula, in Proc. Internat. Symposium on Symbolic and Algebraic Computation (ISSAC '90). 1990, pp. 157-160.
Philippe Flajolet and Ilan Vardi, Zeta function expansions of some classical constants.
Werner Hürlimann, Exact and Asymptotic Evaluation of the Number of Distinct Primitive Cuboids, Journal of Integer Sequences, Vol. 18 (2015), Article 15.2.5.
Yasuyuki Kachi and Pavlos Tzermias, Infinite products involving zeta(3) and Catalan's constant, Journal of Integer Sequences, Vol. 15 (2012), #12.9.4.
F. M. S. Lima, A rapidly converging Ramanujan-type series for Catalan's constant, arXiv:1207.3139v1 [math.NT], Jul 13 2012.
A. Lupas, Formulae for some classical constants, in Proceedings of ROGER-2000, 2000. [Local copy]
David Naccache and Ofer Yifrach-Stav, On Catalan Constant Continued Fractions, arXiv:2210.15669 [cs.SC], 2022.
T. Papanikolaou and G. Fee, Catalan's Constant [Ramanujan's Formula] to 1,500,000 places, Project Gutenberg, 1997.
Kh. Hessami Pilehrood and Tatiana Hessami Pilehrood, Series acceleration formulas for beta values, Discr. Math. Theor. Comp. Sci. 12 (2) (2010) 223-236.
Simon Plouffe, Generalized expansions of real numbers, 2006.
Xiaohan Wang, The Barnes G-function and the Catalan Constant, Kyushu Journal of Mathematics, Vol. 67 (2013) No. 1, pp. 105-116.
Eric Weisstein's World of Mathematics, Catalan's Constant.
Eric Weisstein's World of Mathematics, Catalan's Constant Digits.
Eric Weisstein's World of Mathematics, Hurwitz Zeta Function.
Eric Weisstein's World of Mathematics, Trigamma Function
Wikipedia, Catalan's constant.
Sheldon Yang, Some properties of Catalan's constant G, Int. J. Math. Educ. Sci. Technol 23 (4) (1992) 549-556.
David G. Zeitoun and Thierry Dana-Picard, A half-automated study of a 2-parameter family of integrals, arXiv:2412.11726 [math.CO], 2024. See p. 8.

Cf. A014538, A104338, A153069, A153070, A054543, A118323, A294970/A294971.

R:= RealField(100); Catalan(R); // G. C. Greubel, Aug 21 2018

evalf(Catalan) ; # R. J. Mathar, Apr 09 2013

nmax = 1000; First[RealDigits[Catalan, 10, nmax]] (* Stuart Clary, Dec 17 2008 *)
Integrate[ArcTan[x]/x, {x, 0, 1}] (* N. J. A. Sloane, May 03 2013 *)
N[Im[PolyLog[2, I]], 100] (* Peter Luschny, Oct 04 2019 *)

{ mydigits=20000; default(realprecision, mydigits+80); s=1.0; n=5*mydigits; j=4*n+1; si=-1.0; for (i=3, j-2, s+=si/i^2; si=-si; i++; ); s+=0.5/j^2; ttk=4.0; d=4.0*j^3; xk=2.0; xkp=xk; for (k=2, 100000000, term=(ttk-1)*ttk*xkp; xk++; xkp*=xk; if (k>2, term*=xk; xk++; xkp*=xk; ); term*=bernreal(k)/d; sn=s+term; if (sn==s, break); s=sn; ttk*=4.0; d*=(k+1)*(k+2)*j^2; k++; ); x=10*s; for (n=0, mydigits, d=floor(x); x=(x-d)*10; write("b006752.txt", n, " ", d)); } /* Beta(2) = 1 - 1/3^2 + 1/5^2 - ... - 1/(J-2)^2 + 1/(2*J^2) + 2*Bern(0)/(2*J^3) - 2*3*4*Bern(2)/J^5 + ...  */

default(realprecision,1000+2); /* 1000 terms */
s=sumalt(n=0,(-1)^n/(2*n+1)^2);
v=Vec(Str(s)); /* == ["0", ".", "9", "1", "5", "9", "6", ...*/
vector(#v-2,n,eval(v[n+2]))
/* Joerg Arndt, Aug 25 2011 */

Catalan \\ Charles R Greathouse IV, Nov 20 2011

(zetahurwitz(2,1/4)-Pi^2)/8 \\ Charles R Greathouse IV, Jan 30 2018

lerchphi(-1, 2, 1/2)/4 \\ Charles R Greathouse IV, Jan 30 2025

G = Integral_{x=0..1} arctan(x)/x dx.
G = Integral_{x=0..1} 3*arctan(x*(1-x)/(2-x))/x dx. - Posting to Number Theory List by James Mc Laughlin, Sep 27 2007
G = (zeta(2,1/4)- zeta(2,3/4))/16. - Gerry Martens, May 27 2011 [With the Hurwitz zeta function zeta.]
G = (1/2)*Sum_{n>=0} (-1)^n * ((3*n+2)*8^n) / ((2*n+1)^3*C(2*n,n)^3) (from the Lima 2012 reference).
G = (-1/64)*Sum_{n>=1} (-1)^n * (2^(8*n) * (40*n^2-24*n+3)) / (n^3 * (2*n-1) * C(2*n,n) * C(4*n,2*n)^2) (from the Lupas 2000 reference).
G = phi(-1, 2, 1/2)/4 = A247685/4, where phi is Lerch transcendent. - Jean-François Alcover, Mar 28 2013
G = (1/2)*Integral_{x=0..Pi/2} log(cot(x)+csc(x)) dx. - Jean-François Alcover, Apr 11 2013 [see the Adamchik link]
G = -Integral_{x=0..1} (log x)/(1+x^2) dx = Integral_{x>=1} (log x)/(1+x^2) dx. - Clark Kimberling, Nov 04 2016
G = (Zeta(2, 1/4) - Pi^2)/8 = (Psi(1, 1/4) - Pi^2)/8 = (A282823-Pi^2)/8, with the Hurwitz zeta function and the trigamma function Psi(1, z). For the partial sums of the series given in the name see A294970/A294971. - Wolfdieter Lang, Nov 15 2017
Equals Im(Li_{2}(i)). - Peter Luschny, Oct 04 2019
Equals -Integral_{x=0..Pi/4} log(tan(x)) dx. - Amiram Eldar, Jun 29 2020
Equals (1/2)*Integral_{x=0..1} K(x) dx = -1/2 + Integral_{x=0..1} E(x) dx, where K(k) and E(k) are the complete elliptic integrals of the first and second kind, respectively, as a functions of the elliptic modulus k. - Gleb Koloskov, Jun 25 2021
From Peter Bala, Dec 08 2021: (Start)
G = 1/2 + 4*Sum_{n >= 1} (-1)^(n+1)*n/(4*n^2 - 1)^2 = -13/18 + (2^7)*3*Sum_{n >= 1} (-1)^(n+1)*n/((4*n^2 - 1)^2*(4*n^2 - 9)^2) = -3983/1350 + (2^15)*3*5*Sum_{n >= 1} (-1)^(n+1)*n/((4*n^2 - 1)^2*(4*n^2 - 9)^2*(4*n^2 - 25)^2).
G = 3/2 - 16*Sum_{n >= 1} (-1)^(n+1)*n/(4*n^2 - 1)^3 = 401/6 - (2^13)*(3^3)*Sum_{n >= 1} (-1)^n*n/((4*n^2 - 1)^3*(4*n^2 - 9)^3) = 5255281/1350 - (2^25)*(3^3)*(5^3)*Sum_{n >= 1} (-1)^(n+1)*n/((4*n^2 - 1)^3*(4*n^2 - 9)^3*(4*n^2 - 25)^3). (End)
From Amiram Eldar, Jan 07 2024: (Start)
Equals beta(2), where beta is the Dirichlet beta function.
Equals Product_{p prime >= 3} (1 - (-1)^((p-1)/2)/p^2)^(-1). (End)
Equals 2*Integral_{x=0..Pi/4} log(2*cos(x)) dx = -2*Integral_{x=0..Pi/4} log(2*sin(x)) dx (see Finch). - Stefano Spezia, Nov 14 2024
Equals Integral_{x=0..Pi/4} log((1 + tan(x))/(1 - tan(x))) dx. - Kritsada Moomuang, Jun 03 2025

More terms from Larry Reeves (larryr(AT)acm.org), May 28 2002

A013662 Decimal expansion of zeta(4).

Original entry on oeis.org

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

Offset: 1

N. J. A. Sloane

			1.082323233711138191516003696541167...

M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards Applied Math. Series 55, 1964 (and various reprintings), p. 811.
Louis Comtet, Advanced Combinatorics, Reidel, 1974, p. 89, Exercise.
John H. Conway and Richard K. Guy, The Book of Numbers, New York: Springer-Verlag, 1996. See p. 262.
Richard K. Guy, Unsolved Problems in Number Theory, 3rd Edition, Springer, 2004, Section F17, Series associated with the zeta-function, p. 391.
L. D. Landau and E. M. Lifschitz, Band V, Statistische Physik, Akademie Verlag, 1966, pp. 172 and 180-181.
Paulo Ribenboim, The Little Book of Bigger Primes, Springer-Verlag NY 2004. See p. 162.
David Wells, The Penguin Dictionary of Curious and Interesting Numbers. Penguin Books, NY, 1986, Revised edition 1987, p. 33.

Harry J. Smith, Table of n, a(n) for n = 1..20000
M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards, Applied Math. Series 55, Tenth Printing, 1972 [alternative scanned copy].
Peter Bala, New series for old functions.
D. H. Bailey, J. M. Borwein, and D. M. Bradley, Experimental determination of Apéry-like identities for zeta(4n+2), arXiv:math/0505270 [math.NT], 2005-2006.
D. Borwein and J. M. Borwein, On an intriguing integral and some series related to zeta(4) Proc. Amer. Math. Soc., Vol. 123, No.4, April 1995.
J. M. Borwein, D. J. Broadhurst, and J. Kamnitzer, Central binomial sums, multiple Clausen values and zeta values arXiv:hep-th/0004153, 2000.
Leonhard Euler, On the sums of series of reciprocals, arXiv:math/0506415 [math.HO], 2005-2008.
Leonhard Euler, De summis serierum reciprocarum, E41.
Raffaele Marcovecchio and Wadim Zudilin, Hypergeometric rational approximations to zeta(4), arXiv:1905.12579 [math.NT], 2019.
Romeo Meštrović, Euclid's theorem on the infinitude of primes: a historical survey of its proofs (300 BC--2012) and another new proof, arXiv:1202.3670 [math.HO], 2012. - From _N. J. A. Sloane_, Jun 13 2012
Jean-Christophe Pain, An integral representation for zeta(4), arXiv:2309.00539 [math.NT], 2023.
Michael Penn, Finding a closed form for zeta(4), YouTube video, 2022.
Simon Plouffe, Pi^4/90 to 100000 digits.
Simon Plouffe, Zeta(4) or Pi^4/90 to 10000 places.
Simon Plouffe, Zeta(2) to Zeta(4096) to 2048 digits each (gzipped file).
K. Ramachandra, On series integrals and continued fractions I, Hardy-Ramanujan Journal, Vol. 4 (1981), pp. 1-11.
Carsten Schneider and Wadim Zudilin, A case study for zeta(4), arXiv:2004.08158 [math.NT], 2020.
Chuanan Wei, Some fast convergent series for the mathematical constants zeta(4) and zeta(5), arXiv:2303.07887 [math.CO], 2023.
Index entries for transcendental numbers.

Cf. A013661, A002117, A013663, A013664, A013665, A013666, A013667, A013668, A013669, A013670, A013671, A013672, A013673, A013674, A013675, A013676, A013677, A013678, A293904.
Cf. A231535, A337711.
Cf. A001008, A002805.
See also the extensive crossref table in A308637.

SetDefaultRealField(RealField(110)); L:=RiemannZeta(); Evaluate(L,4); // G. C. Greubel, May 30 2019

evalf(Pi^4/90,120); # Muniru A Asiru, Sep 19 2018

RealDigits[Zeta[4],10,120][[1]] (* Harvey P. Dale, Dec 18 2012 *)

ev(zeta(4),numer) ; /* R. J. Mathar, Feb 27 2012 */

default(realprecision, 20080); x=Pi^4/90; for (n=1, 20000, d=floor(x); x=(x-d)*10; write("b013662.txt", n, " ", d)); \\ Harry J. Smith, Apr 29 2009

numerical_approx(zeta(4), digits=100) # G. C. Greubel, May 30 2019

zeta(4) = Pi^4/90 = A092425/90. - Harry J. Smith, Apr 29 2009
From Peter Bala, Dec 03 2013: (Start)
Definition: zeta(4) := Sum_{n >= 1} 1/n^4.
zeta(4) = (4/17)*Sum_{n >= 1} ( (1 + 1/2 + ... + 1/n)/n )^2 and
zeta(4) = (16/45)*Sum_{n >= 1} ( (1 + 1/3 + ... + 1/(2*n-1))/n )^2 (see Borwein and Borwein).
zeta(4) = (256/90)*Sum_{n >= 1} n^2*(4*n^2 + 3)*(12*n^2 + 1)/(4*n^2 - 1)^5.
Series acceleration formulas:
zeta(4) = (36/17)*Sum_{n >= 1} 1/( n^4*binomial(2*n,n) ) (Comtet)
        = (36/17)*Sum_{n >= 1} P(n)/( (2*n*(2*n - 1))^4*binomial(4*n,2*n) )
        = (36/17)*Sum_{n >= 1} Q(n)/( (3*n*(3*n - 1)*(3*n - 2))^4*binomial(6*n,3*n) ),
where P(n) = 80*n^4 - 48*n^3 + 24*n^2 - 8*n + 1 and Q(n) = 137781*n^8 - 275562*n^7 + 240570*n^6 - 122472*n^5 + 41877*n^4 - 10908*n^3 + 2232*n^2 - 288*n + 16 (see section 8 in the Bala link). (End)
zeta(4) = 2/3*2^4/(2^4 - 1)*( Sum_{n even} n^2*p(n)/(n^2 - 1)^5 ), where p(n) = 3*n^4 + 10*n^2 + 3 is a row polynomial of A091043. See A013664, A013666, A013668 and A013670. - Peter Bala, Dec 05 2013
zeta(4) = Sum_{n >= 1} ((floor(sqrt(n))-floor(sqrt(n-1)))/n^2). - Mikael Aaltonen, Jan 18 2015
zeta(4) = Product_{k>=1} 1/(1 - 1/prime(k)^4). - Vaclav Kotesovec, May 02 2020
From Wolfdieter Lang, Sep 16 2020: (Start)
zeta(4) = (1/3!)*Integral_{x=0..oo} x^3/(exp(x) - 1) dx. See Abramowitz-Stegun, 23.2.7., for s=2, p. 807, and Landau-Lifschitz, Band V, p. 172, eq. (4), for x=4. See also A231535.
zeta(4) = (4/21)*Integral_{x=0..oo} x^3/(exp(x) + 1) dx. See Abramowitz-Stegun, 23.2.8., for s=2, p. 807, and Landau-Lifschitz, Band V, p. 172, eq. (1), for x=4. See also A337711. (End)
zeta(4) = (72/17) * Integral_{x=0..Pi/3} x*(log(2*sin(x/2)))^2. See Richard K. Guy reference. - Bernard Schott, Jul 20 2022
From Peter Bala, Nov 12 2023: (Start)
zeta(4) = 1 + (4/3)*Sum_{k >= 1} (1 - 2*(-1)^k)/(k*(k + 1)^4*(k + 2)) = 35053/32400 + 48*Sum_{k >= 1} (1 - 2*(-1)^k)/(k*(k + 1)*(k + 2)*(k + 3)^4*(k + 4)*(k + 5)*(k + 6)).
More generally, it appears that for n >= 0, zeta(4) = c(n) + (4/3)*(2*n + 1)!^2 * Sum_{k >= 1} (1 - 2*(-1)^k)/( (k + 2*n + 1)^3*Product_{i = 0..4*n+2} (k + i) ), where {c(n) : n >= 0} is a sequence of rational approximations to zeta(4) beginning [1, 35053/32400, 2061943067/ 1905120000, 18594731931460103/ 17180389306080000, 257946156103293544441/ 238326360453941760000, ...]. (End)
From Peter Bala, Apr 27 2025: (Start)
zeta(4) = 1/4! * Integral_{x >= 0} x^4 * exp(x)/(exp(x) - 1)^2 dx = 8/7 * 1/4! * Integral_{x >= 0} x^4 * exp(x)/(exp(x) + 1)^2 dx.
zeta(4) = 1/5! * Integral_{x >= 0} x^5 * exp(x)*(exp(x) + 1)/(exp(x) - 1)^3 dx = 1/(3*5*7) * Integral_{x >= 0} x^5 * exp(x)*(exp(x) - 1)/(exp(x) + 1)^3 dx. (End)
10*zeta(4) = Sum_{k>=1} H(k)^3/(k*(k+1)), where H(k) = A001008(k)/A002805(k) is the k-th harmonic number (Ramachandra, 1981). - Amiram Eldar, May 30 2025
zeta(4) = Integral_{x=0..1} Li(3,x)/x dx, where Li(n,x) is the polylogarithm function. - Kritsada Moomuang, Jun 14 2025
zeta(4) = Sum_{i, j >= 1} 1/(i^3*j*binomial(i+j, i)) = 4/3 * Sum_{i, j >= 1} 1/(i^2*j^2*binomial(i+j, i)). - Peter Bala, Aug 03 2025

A013663 Decimal expansion of zeta(5).

Original entry on oeis.org

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

Offset: 1

N. J. A. Sloane

In a widely distributed May 2011 email, Wadim Zudilin gave a rebuttal to v1 of Kim's 2011 preprint: "The mistake (unfixable) is on p. 6, line after eq. (3.3). 'Without loss of generality' can be shown to work only for a finite set of n_k's; as the n_k are sufficiently large (and N is fixed), the inequality for epsilon is false." In a May 2013 email, Zudilin extended his rebuttal to cover v2, concluding that Kim's argument "implies that at least one of zeta(2), zeta(3), zeta(4) and zeta(5) is irrational, which is trivial." - Jonathan Sondow, May 06 2013

General: zeta(2*s + 1) = (A000364(s)/A331839(s)) * Pi^(2*s + 1) * Product_{k >= 1} (A002145(k)^(2*s + 1) + 1)/(A002145(k)^(2*s + 1) - 1), for s >= 1. - Dimitris Valianatos, Apr 27 2020

			1/1^5 + 1/2^5 + 1/3^5 + 1/4^5 + 1/5^5 + 1/6^5 + 1/7^5 + ... =
1 + 1/32 + 1/243 + 1/1024 + 1/3125 + 1/7776 + 1/16807 + ... = 1.036927755143369926331365486457...

John H. Conway and Richard K. Guy, The Book of Numbers, New York: Springer-Verlag, 1996. See p. 262.
Milton Abramowitz and Irene A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards Applied Math. Series 55, 1964 (and various reprintings), p. 811.

Milton Abramowitz and Irene A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards, Applied Math. Series 55, Tenth Printing, 1972 [alternative scanned copy].
Michael J. Dancs and Tian-Xiao He, An Euler-type formula for zeta(2k+1), Journal of Number Theory, Volume 118, Issue 2, June 2006, Pages 192-199.
Robert J. Harley, Zeta(3), Zeta(5), .., Zeta(99) 10000 digits (txt, 400 KB).
Yong-Cheol Kim, zeta(5) is irrational, arXiv:1105.0730 [math.CA], 2011. [Jonathan Vos Post, May 4, 2011].
Simon Plouffe, Computation of Zeta(5)
Simon Plouffe, Zeta(5), the sum(1/n**5, n=1..infinity) to 512 digits
Simon Plouffe, Other interesting computations at numberworld.org.
Zhi-Wei Sun, A curious hypergeometric series related to Riemann's zeta function, Question 486353 at MathOverflow, Jan. 21, 2025.
Chuanan Wei, Some fast convergent series for the mathematical constants zeta(4) and zeta(5), arXiv:2303.07887 [math.CO], 2023.
Wikipedia, Zeta constant
Wadim Zudilin, One of the numbers ζ(5), ζ(7), ζ(9), ζ(11) is irrational, Russ. Math. Surv., 56 (2001), 774-776.
Index entries for constants related to zeta

Cf. A013661, A002117, A013662, A013664, A013665, A013666, A013667, A013668, A013669, A013670, A013671, A013672, A013673, A013674, A013675, A013676, A013677, A013678, A293904.
Cf. A243264, A255323.
Cf. A023872, A023873, A248882, A255050, A255052, A057528, A260404.

RealDigits[Zeta[5], 10, 100][[1]] (* Alonso del Arte, Jan 13 2012 *)

PARI
```
zeta(5) \\ Michel Marcus, Apr 17 2016
```

From Peter Bala, Dec 04 2013: (Start)
Definition: zeta(5) = Sum_{n >= 1} 1/n^5.
zeta(5) = 2^5/(2^5 - 1)*(Sum_{n even} n^5*p(n)*p(1/n)/(n^2 - 1)^6 ), where p(n) = n^2 + 3. See A013667, A013671 and A013675. (End)
zeta(5) = Sum_{n >= 1} (A010052(n)/n^(5/2)) = Sum_{n >= 1} ((floor(sqrt(n)) - floor(sqrt(n-1)))/n^(5/2)). - Mikael Aaltonen, Feb 22 2015
zeta(5) = Product_{k>=1} 1/(1 - 1/prime(k)^5). - Vaclav Kotesovec, Apr 30 2020
From Artur Jasinski, Jun 27 2020: (Start)
zeta(5) = (-1/30)*Integral_{x=0..1} log(1-x^4)^5/x^5.
zeta(5) = (1/24)*Integral_{x=0..infinity} x^4/(exp(x)-1).
zeta(5) = (2/45)*Integral_{x=0..infinity} x^4/(exp(x)+1).
zeta(5) = (1/(1488*zeta(1/2)^5))*(-5*Pi^5*zeta(1/2)^5 + 96*zeta'(1/2)^5 - 240*zeta(1/2)*zeta'(1/2)^3*zeta''(1/2) + 120*zeta(1/2)^2*zeta'(1/2)*zeta''(1/2)^2 + 80*zeta(1/2)^2*zeta'(1/2)^2*zeta'''(1/2)- 40*zeta(1/2)^3*zeta''(1/2)*zeta'''(1/2) - 20*zeta(1/2)^3*zeta'(1/2)*zeta''''(1/2)+4*zeta(1/2)^4*zeta'''''(1/2)). (End).
From Peter Bala, Oct 29 2023: (Start)
zeta(3) = (8/45)*Integral_{x >= 1} x^3*log(x)^3*(1 + log(x))*log(1 + 1/x^x) dx =  (2/45)*Integral_{x >= 1} x^4*log(x)^4*(1 + log(x))/(1 + x^x) dx.
zeta(5) = 131/128 + 26*Sum_{n >= 1} (n^2 + 2*n + 40/39)/(n*(n + 1)*(n + 2))^5.
zeta(5) =  5162893/4976640 - 1323520*Sum_{n >= 1} (n^2 + 4*n + 56288/12925)/(n*(n + 1)*(n + 2)*(n + 3)*(n + 4))^5. Taking 10 terms of the series gives a value for zeta(5) correct to 20 decimal places.
Conjecture: for k >= 1, there exist rational numbers A(k), B(k) and c(k) such that zeta(5) = A(k) + B(k)*Sum_{n >= 1} (n^2 + 2*k*n + c(k))/(n*(n + 1)*...*(n + 2*k))^5. A similar conjecture can be made for the constant zeta(3). (End)
zeta(5) = (694/204813)*Pi^5 - Sum_{n >= 1} (6280/3251)*(1/(n^5*(exp(4*Pi*n)-1))) + Sum_{n >= 1} (296/3251)*(1/(n^5*(exp(5*Pi*n)-1))) - Sum_{n >= 1} (1073/6502)*(1/(n^5*(exp(10*Pi*n)-1))) + Sum_{n >= 1} (37/6502)*(1/(n^5*(exp(20*Pi*n)-1))). - Simon Plouffe, Jan 06 2024
From Peter Bala, Apr 27 2025: (Start)
zeta(5) = 1/5! * Integral_{x >= 0} x^5 * exp(x)/(exp(x) - 1)^2 dx = (16/15) * 1/5! * Integral_{x >= 0} x^5 * exp(x)/(exp(x) + 1)^2 dx.
zeta(5) = 1/6! * Integral_{x >= 0} x^6 * exp(x)*(exp(x) + 1)/(exp(x) - 1)^3 dx = 1/(3^3 * 5^2) * Integral_{x >= 0} x^6 * exp(x)*(exp(x) - 1)/(exp(x) + 1)^3 dx. (End)
zeta(5) = Sum_{i, j >= 1} 1/((i^4)*j*binomial(i+j, i)). More generally, zeta(n+1) = Sum_{i, j >= 1} 1/((i^n)*j*binomial(i+j, i)) for n >= 1. - Peter Bala, Aug 07 2025

A059956 Decimal expansion of 6/Pi^2.

Original entry on oeis.org

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

Offset: 0

Jason Earls, Mar 01 2001

"6/Pi^2 is the probability that two randomly selected numbers will be coprime and also the probability that a randomly selected integer is 'squarefree.'" [Hardy and Wright] - C. Pickover.
In fact, the probability that any k randomly selected numbers will be coprimes is 1/Sum_{n>=1} n^(-k) = 1/zeta(k). - Robert G. Wilson v [corrected by Ilya Gutkovskiy, Aug 18 2018]
6/Pi^2 is also the diameter of a circle whose circumference equals the ratio of volume of a cuboid to the inscribed ellipsoid. 6/Pi^2 is also the diameter of a circle whose circumference equals the ratio of surface area of a cube to the inscribed sphere. - Omar E. Pol, Oct 08 2011
6/(Pi^2 * n^2) is the probability that two randomly selected positive integers will have a greatest common divisor equal to n, n >= 1. - Geoffrey Critzer, May 28 2013
Equals lim_{n->oo} (Sum_{k=1..n} phi(k)/k)/n, i.e., the limit mean value of phi(k)/k, where phi(k) is Euler's totient function. Proof is trivial using the formula for Sum_{k=1..n} phi(k)/k listed at the Wikipedia link. For the limit mean value of k/phi(k), see A082695. - Stanislav Sykora, Nov 14 2014
This is the probability that a random point on a square lattice is visible from the origin, i.e., there is no other lattice point that lies on the line segment between this point and the origin. - Amiram Eldar, Jul 08 2020

			.6079271018540266286632767792583658334261526480...

Steven R. Finch, Mathematical Constants, Encyclopedia of Mathematics and its Applications, vol. 94, Cambridge University Press, Section 1.4, p. 18.
Hardy and Wright, 'An Introduction to the Theory of Numbers'. See Theorems 332 and 333.
C. Pickover, Wonders of Numbers, Oxford University Press, NY, 2001, p. 359.
Paulo Ribenboim, The Little Book of Bigger Primes, Springer-Verlag NY 2004. See p. 184.
James J. Tattersall, Elementary Number Theory in Nine Chapters, Cambridge University Press, 1999, pages 118-119.
David Wells, The Penguin Dictionary of Curious and Interesting Numbers. Penguin Books, NY, 1986, Revised edition 1987, p. 28.

Harry J. Smith, Table of n, a(n) for n = 0..20000
Persi Diaconis and Paul Erdős, On the distribution of the greatest common divisor, in A Festschrift for Herman Rubin, pp. 56-61, IMS Lecture Notes Monogr. Ser., 45, Inst. Math. Statist., Beachwood, OH, 2004.
C. A. Pickover, "Wonders of Numbers, Adventures in Mathematics, Mind and Meaning," Zentralblatt review.
Harry J. Smith, XPCalc. [Broken link]
Eric Weisstein's World of Mathematics, Hafner-Sarnak-McCurley Constant.
Eric Weisstein's World of Mathematics, Relatively Prime.
Eric Weisstein's World of Mathematics, Squarefree.
Wikipedia, Euler's totient function.
Index entries for transcendental numbers.

See A002117 for further references and links.

Cf. A005117 (squarefree numbers), A013661, A082695.

R:= RealField(100); 6/(Pi(R))^2; // G. C. Greubel, Mar 09 2018

evalf(1/Zeta(2)) ; # R. J. Mathar, Mar 27 2013

RealDigits[ 6/Pi^2, 10, 105][[1]]
RealDigits[1/Zeta[2], 10, 111][[1]] (* Robert G. Wilson v, Jan 20 2017 *)

default(realprecision, 20080); x=60/Pi^2; for (n=0, 20000, d=floor(x); x=(x-d)*10; write("b059956.txt", n, " ", d)); \\ Harry J. Smith, Jun 30 2009

Equals 1/A013661.

6/Pi^2 = Product_{k>=1} (1 - 1/prime(k)^2) = Sum_{k>=1} mu(k)/k^2. - Vladeta Jovovic, May 18 2001

A005259 Apery (Apéry) numbers: Sum_{k=0..n} (binomial(n,k)*binomial(n+k,k))^2.

Original entry on oeis.org

1, 5, 73, 1445, 33001, 819005, 21460825, 584307365, 16367912425, 468690849005, 13657436403073, 403676083788125, 12073365010564729, 364713572395983725, 11111571997143198073, 341034504521827105445, 10534522198396293262825, 327259338516161442321485

Offset: 0

Simon Plouffe, N. J. A. Sloane, May 20 1991

Conjecture: For each n = 1,2,3,... the Apéry polynomial A_n(x) = Sum_{k = 0..n} binomial(n,k)^2*binomial(n+k,k)^2*x^k is irreducible over the field of rational numbers. - Zhi-Wei Sun, Mar 21 2013
The expansions of exp( Sum_{n >= 1} a(n)*x^n/n ) = 1 + 5*x + 49*x^2 + 685*x^3 + 11807*x^4 + 232771*x^5 + ... and exp( Sum_{n >= 1} a(n-1)*x^n/n ) = 1 + 3*x + 27*x^2 + 390*x^3 + 7038*x^4 + 144550*x^5 + ... both appear to have integer coefficients. See A267220. - Peter Bala, Jan 12 2016
Diagonal of the rational function R(x, y, z, w) = 1 / (1 - (w*x*y*z + w*x*y + w*z + x*y + x*z + y + z)); also diagonal of rational function H(x, y, z, w) = 1/(1 - w*(1+x)*(1+y)*(1+z)*(x*y*z + y*z + y + z + 1)). - Gheorghe Coserea, Jun 26 2018
Named after the French mathematician Roger Apéry (1916-1994). - Amiram Eldar, Jun 10 2021

			G.f. = 1 + 5*x + 73*x^2 + 1445*x^3 + 33001*x^4 + 819005*x^5 + 21460825*x^6 + ...
a(2) = (binomial(2,0) * binomial(2+0,0))^2 + (binomial(2,1) * binomial(2+1,1))^2 + (binomial(2,2) * binomial(2+2,2))^2 = (1*1)^2 + (2*3)^2 + (1*6)^2 = 1 + 36 + 36 = 73. - _Michael B. Porter_, Jul 14 2016

Julian Havil, The Irrationals, Princeton University Press, Princeton and Oxford, 2012, pp. 137-153.
Wolfram Koepf, Hypergeometric Identities. Ch. 2 in Hypergeometric Summation: An Algorithmic Approach to Summation and Special Function Identities. Braunschweig, Germany: Vieweg, pp. 55, 119 and 146, 1998.
Maxim Kontsevich and Don Zagier, Periods, pp. 771-808 of B. Engquist and W. Schmid, editors, Mathematics Unlimited - 2001 and Beyond, 2 vols., Springer-Verlag, 2001.
Leonard Lipshitz and Alfred van der Poorten, "Rational functions, diagonals, automata and arithmetic." In Number Theory, Richard A. Mollin, ed., Walter de Gruyter, Berlin (1990), pp. 339-358.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Seiichi Manyama, Table of n, a(n) for n = 0..656 (first 101 terms from T. D. Noe)
Boris Adamczewski, Jason P. Bell and Eric Delaygue, Algebraic independence of G-functions and congruences "a la Lucas", arXiv preprint arXiv:1603.04187 [math.NT], 2016.
Jean-Paul Allouche, A remark on Apéry's numbers, J. Comput. Appl. Math., Vol. 83 (1997), pp. 123-125.
Roger Apéry, Irrationalité de zeta(2) et zeta(3), in Journées Arith. de Luminy. Colloque International du Centre National de la Recherche Scientifique (CNRS) held at the Centre Universitaire de Luminy, Luminy, Jun 20-24, 1978. Astérisque, Vol. 61 (1979), pp. 11-13.
Roger Apéry, Sur certaines séries entières arithmétiques, Groupe de travail d'analyse ultramétrique, Vol. 9, No. 1 (1981-1982), Exp. No. 16, 2 p.
Roger Apéry, Interpolation de fractions continues et irrationalité de certaines constantes, Bulletin de la section des sciences du C.T.H.S III (1981), pp. 37-53.
Thomas Baruchel and Carsten Elsner, On error sums formed by rational approximations with split denominators, arXiv preprint arXiv:1602.06445 [math.NT], 2016.
Frits Beukers, Another congruence for the Apéry numbers, J. Number Theory, Vol. 25, No. 2 (1987), pp. 201-210.
Frits Beukers, Consequences of Apéry's work on zeta(3), in "Zeta(3) irrationnel: les retombées", Rencontres Arithmétiques de Caen, June 2-3, 1995 [Mentions divisibility of a(n) by powers of 5 and powers of 11]
Francis Brown, Irrationality proofs for zeta values, moduli spaces and dinner parties, arXiv:1412.6508 [math.NT], 2014.
William Y. C. Chen, Qing-Hu Hou and Yan-Ping Mu, A telescoping method for double summations, J. Comp. Appl. Math., Vol. 196, No. 2 (2006), pp. 553-566, Example 4.
Shaun Cooper, Apéry-like sequences defined by four-term recurrence relations, arXiv:2302.00757 [math.NT], 2023. See Table 2 p. 7.
M. Coster, Email, Nov 1990
Eric Delaygue, Arithmetic properties of Apéry-like numbers, arXiv preprint arXiv:1310.4131 [math.NT], 2013.
Emeric Deutsch and Bruce E. Sagan, Congruences for Catalan and Motzkin numbers and related sequences, arXiv:math/0407326 [math.CO], 2004.
Emeric Deutsch and Bruce E. Sagan, Congruences for Catalan and Motzkin numbers and related sequences, J. Num. Theory 117 (2006), 191-215.
Gerald A. Edgar, A formula with Legendre polynomials, Sci. Math. Research posting Mar 21 2005.
G. A. Edgar, The Apéry Numbers as a Stieltjes Moment Sequence, arXiv:2005.10733 [math.CA], 2020.
Carsten Elsner, On recurrence formulas for sums involving binomial coefficients, Fib. Q., Vol. 43, No. 1 (2005), pp. 31-45.
Carsten Elsner, On prime-detecting sequences from Apéry's recurrence formulas for zeta(3) and zeta(2), JIS, Vol. 11 (2008), Article 08.5.1.
Stéphane Fischler, Irrationalité de valeurs de zeta, arXiv:math/0303066 [math.NT], 2003.
Scott Garrabrant and Igor Pak, Counting with irrational tiles, arXiv:1407.8222 [math.CO], 2014.
Ira Gessel, Some congruences for Apéry numbers, Journal of Number Theory, Vol. 14, No. 3 (1982) 362-368.
Ofir Gorodetsky, New representations for all sporadic Apéry-like sequences, with applications to congruences, arXiv:2102.11839 [math.NT], 2021. See gamma p. 3.
Richard K. Guy, Letter to N. J. A. Sloane, Oct 1985
Vaclav Kotesovec, Asymptotic of generalized Apéry sequences with powers of binomial coefficients, Nov 04 2012
Antoine Labelle et al., A formula for Apéry numbers, MathOverflow, 2025.
Leonard Lipshitz and Alfred J. van der Poorten, Rational functions, diagonals, automata and arithmetic, in: Richard A. Mollin (ed.), Number theory, Proceedings of the First Conference of the Canadian Number Theory Association Held at the Banff Center, Banff, Alberta, April 17-27, 1988, de Gruyter, 2016, pp. 339-358; alternative link; Wayback Machine copy.
Ji-Cai Liu, Supercongruences for the (p-1)th Apéry number, arXiv:1803.11442 [math.NT], 2018.
Amita Malik and Armin Straub, Divisibility properties of sporadic Apéry-like numbers, Research in Number Theory, Vol. 2 (2016), Article 5.
Stephen Melczer and Bruno Salvy, Symbolic-Numeric Tools for Analytic Combinatorics in Several Variables, arXiv:1605.00402 [cs.SC], 2016.
Romeo Meštrović, Lucas' theorem: its generalizations, extensions and applications (1878--2014), arXiv preprint arXiv:1409.3820 [math.NT], 2014.
Robert Osburn and Brundaban Sahu, A supercongruence for generalized Domb numbers, Funct. Approx. Comment. Math., Vol. 48, No. 1 (2013), pp. 29-36; alternative link.
Math Overflow, A conjectured formula for Apéry numbers
Eric Rowland and Reem Yassawi, Automatic congruences for diagonals of rational functions, Journal de théorie des nombres de Bordeaux, Vol. 27, No. 1 (2015), pp. 245-288; arXiv preprint, arXiv:1310.8635 [math.NT], 2013-2014.
Eric Rowland, Reem Yassawi and Christian Krattenthaler, Lucas congruences for the Apéry numbers modulo p^2, arXiv:2005.04801 [math.NT], 2020.
Andrew Strangeway, A Reconstruction Theorem for Quantum Cohomology of Fano Bundles on Projective Space, arXiv preprint arXiv:1302.5089 [math.AG], 2013.
Andrew Strangeway, Quantum reconstruction for Fano bundles on projective space, Nagoya Math. J., Vol. 218 (2015), pp. 1-28.
Armin Straub, Multivariate Apéry numbers and supercongruences of rational functions, Algebra & Number Theory, Vol. 8, No. 8 (2014), pp. 1985-2008; arXiv preprint, arXiv:1401.0854 [math.NT], 2014.
Volker Strehl, Recurrences and Legendre transform, Séminaire Lotharingien de Combinatoire, B29b (1992), 22 pp.
Volker Strehl, Binomial identities -- combinatorial and algorithmic aspects, Discrete Mathematics, Vol. 136 (1994), 309-346.
Zhi-Hong Sun, Congruences for Apéry-like numbers, arXiv:1803.10051 [math.NT], 2018.
Zhi-Hong Sun, New congruences involving Apéry-like numbers, arXiv:2004.07172 [math.NT], 2020.
Zhi-Wei Sun, Congruences for Franel numbers, arXiv preprint arXiv:1112.1034 [math.NT], 2011.
Zhi-Wei Sun, On sums of Apéry polynomials and related congruences, J. Number Theory 132(2012), 2673-2699. [_Zhi-Wei Sun_, Mar 21 2013]
Zhi-Wei Sun. Sun, On sums of Apéry polynomials and related congruences, arXiv:1101.1946 [math.NT], 2011-2014. [_Zhi-Wei Sun_, Mar 21 2013]
Alfred van der Poorten, A proof that Euler missed ..., Math. Intelligencer, Vol. 1, No. 4 (December 1979), pp. 196-203, (b_n) after eq. (1.2), and Exercise 3.
Chen Wang, Two congruences concerning Apéry numbers, arXiv:1909.08983 [math.NT], 2019.
Eric Weisstein's World of Mathematics, Apéry Number.
Eric Weisstein's World of Mathematics, Strehl Identities.
Eric Weisstein's World of Mathematics, Schmidt's Problem.
Ernest X. W. Xia and Olivia X. M. Yao, A Criterion for the Log-Convexity of Combinatorial Sequences, The Electronic Journal of Combinatorics, Vol. 20 (2013), #P3.

Apéry's number or Apéry's constant zeta(3) is A002117. - N. J. A. Sloane, Jul 11 2023
Cf. A002736, A005258, A005429, A005430, A059415, A059416, A063007, A000172.
Cf. A006221, A000578, A006353.
Related to diagonal of rational functions: A268545-A268555.
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.)
For primes that do not divide the terms of the sequences A000172, A005258, A002893, A081085, A006077, A093388, A125143, A229111, A002895, A290575, A290576, A005259 see A260793, A291275-A291284 and A133370 respectively.
Cf. A092826 (prime terms).

List([0..20],n->Sum([0..n],k->Binomial(n,k)^2*Binomial(n+k,k)^2)); # Muniru A Asiru, Sep 28 2018

a005259 n = a005259_list !! n
a005259_list = 1 : 5 : zipWith div (zipWith (-)
   (tail $ zipWith (*) a006221_list a005259_list)
   (zipWith (*) (tail a000578_list) a005259_list)) (drop 2 a000578_list)
-- Reinhard Zumkeller, Mar 13 2014

[&+[Binomial(n, k) ^2 *Binomial(n+k, k)^2: k in [0..n]]:n in  [0..17]]; // Marius A. Burtea, Jan 20 2020

a := proc(n) option remember; if n=0 then 1 elif n=1 then 5 else (n^(-3))* ( (34*(n-1)^3 + 51*(n-1)^2 + 27*(n-1) +5)*a((n-1)) - (n-1)^3*a((n-1)-1)); fi; end;
# Alternative:
a := n -> hypergeom([-n, -n, 1+n, 1+n], [1, 1, 1], 1):
seq(simplify(a(n)), n=0..17); # Peter Luschny, Jan 19 2020

Table[HypergeometricPFQ[{-n, -n, n+1, n+1}, {1,1,1}, 1],{n,0,13}] (* Jean-François Alcover, Apr 01 2011 *)
Table[Sum[(Binomial[n,k]Binomial[n+k,k])^2,{k,0,n}],{n,0,30}] (* Harvey P. Dale, Oct 15 2011 *)
a[ n_] := SeriesCoefficient[ SeriesCoefficient[ SeriesCoefficient[ SeriesCoefficient[ 1 / (1 - t (1 + x ) (1 + y ) (1 + z ) (x y z + (y + 1) (z + 1))), {t, 0, n}], {x, 0, n}], {y, 0, n}], {z, 0, n}]; (* Michael Somos, May 14 2016 *)

a(n)=sum(k=0,n,(binomial(n,k)*binomial(n+k,k))^2) \\ Charles R Greathouse IV, Nov 20 2012

def A005259(n):
    m, g = 1, 0
    for k in range(n+1):
        g += m
        m *= ((n+k+1)*(n-k))**2
        m //=(k+1)**4
    return g # Chai Wah Wu, Oct 02 2022

D-finite with recurrence (n+1)^3*a(n+1) = (34*n^3 + 51*n^2 + 27*n + 5)*a(n) - n^3*a(n-1), n >= 1.
Representation as a special value of the hypergeometric function 4F3, in Maple notation: a(n)=hypergeom([n+1, n+1, -n, -n], [1, 1, 1], 1), n=0, 1, ... - Karol A. Penson Jul 24 2002
a(n) = Sum_{k >= 0} A063007(n, k)*A000172(k). A000172 = Franel numbers. - Philippe Deléham, Aug 14 2003
G.f.: (-1/2)*(3*x - 3 + (x^2-34*x+1)^(1/2))*(x+1)^(-2)*hypergeom([1/3,2/3],[1],(-1/2)*(x^2 - 7*x + 1)*(x+1)^(-3)*(x^2 - 34*x + 1)^(1/2)+(1/2)*(x^3 + 30*x^2 - 24*x + 1)*(x+1)^(-3))^2. - Mark van Hoeij, Oct 29 2011
Let g(x, y) = 4*cos(2*x) + 8*sin(y)*cos(x) + 5 and let P(n,z) denote the Legendre polynomial of degree n. Then G. A. Edgar posted a conjecture of Alexandru Lupas that a(n) equals the double integral 1/(4*Pi^2)*int {y = -Pi..Pi} int {x = -Pi..Pi} P(n,g(x,y)) dx dy. (Added Jan 07 2015: Answered affirmatively in Math Overflow question 178790) - Peter Bala, Mar 04 2012; edited by G. A. Edgar, Dec 10 2016
a(n) ~ (1+sqrt(2))^(4*n+2)/(2^(9/4)*Pi^(3/2)*n^(3/2)). - Vaclav Kotesovec, Nov 01 2012
a(n) = Sum_{k=0..n} C(n,k)^2 * C(n+k,k)^2. - Joerg Arndt, May 11 2013
0 = (-x^2+34*x^3-x^4)*y''' + (-3*x+153*x^2-6*x^3)*y'' + (-1+112*x-7*x^2)*y' + (5-x)*y, where y is g.f. - Gheorghe Coserea, Jul 14 2016
From Peter Bala, Jan 18 2020: (Start)
a(n) = Sum_{0 <= j, k <= n} (-1)^(n+j) * C(n,k)^2 * C(n+k,k)^2 * C(n,j) * C(n+k+j,k+j).
a(n) = Sum_{0 <= j, k <= n} C(n,k) * C(n+k,k) * C(k,j)^3 (see Koepf, p. 55).
a(n) = Sum_{0 <= j, k <= n} C(n,k)^2 * C(n,j)^2 * C(3*n-j-k,2*n) (see Koepf, p. 119).
Diagonal coefficients of the rational function 1/((1 - x - y)*(1 - z - t) - x*y*z*t) (Straub, 2014). (End)
a(n) = [x^n] 1/(1 - x)*( Legendre_P(n,(1 + x)/(1 - x)) )^m at m = 2. At m = 1 we get the Apéry numbers A005258. - Peter Bala, Dec 22 2020
a(n) = Sum_{k = 0..n} (-1)^(n+k)*binomial(n, k)*binomial(n+k, k)*A108625(n, k). - Peter Bala, Jul 18 2024
a(n) = Sum_{k=0..n} Sum_{j=0..n} C(n,k)^2 * C(n,j)^2 * C(k+j,k), see Labelle et al. link. - Max Alekseyev, Mar 12 2025

A013664 Decimal expansion of zeta(6).

Original entry on oeis.org

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

Offset: 1

N. J. A. Sloane

			1.01734306198444913...

M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards Applied Math. Series 55, 1964 (and various reprintings), p. 811.
John H. Conway and Richard K. Guy, The Book of Numbers, New York: Springer-Verlag, 1996. See p. 262.

Muniru A Asiru, Table of n, a(n) for n = 1..2000
M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards, Applied Math. Series 55, Tenth Printing, 1972 [alternative scanned copy].
D. H. Bailey, J. M. Borwein and D. M. Bradley, Experimental determination of Apéry-like identities for zeta(4n+2), arXiv:math/0505270 [math.NT], 2005-2006.
Ankush Goswami, A q-analogue for Euler's ζ(6) = π^6/945, arXiv:1802.08529 [math.NT], 2018.
Index entries for constants related to zeta.

Cf. A013661, A002117, A013662, A013663, A013665, A013666, A013667, A013668, A013669, A013670, A013671, A013672, A013673, A013674, A013675, A013676, A013677, A013678, A293904.

Cf. A337710.

evalf(Pi^6/945) ;  # R. J. Mathar, Oct 16 2015

RealDigits[Zeta[6], 10, 100][[1]] (* Vincenzo Librandi, Feb 15 2015 *)

PARI
```
zeta(6) \\ Michel Marcus, Feb 15 2015
```

Equals Pi^6/945 = A092732/945. - Mohammad K. Azarian, Mar 03 2008
zeta(6) = 8/3*2^6/(2^6 - 1)*( Sum_{n even} n^2*p(n)/(n^2 - 1)^7 ), where p(n) = n^6 + 7*n^4 + 7*n^2 + 1 is a row polynomial of A091043. See A013662, A013666, A013668 and A013670. - Peter Bala, Dec 05 2013
Definition: zeta(6) = Sum_{n >= 1} 1/n^6. - Bruno Berselli, Dec 05 2013
zeta(6) = Sum_{n >= 1} (A010052(n)/n^3). - Mikael Aaltonen, Feb 20 2015
zeta(6) = Sum_{n >= 1} (A010057(n)/n^2). - A.H.M. Smeets, Sep 19 2018
zeta(6) = Product_{k>=1} 1/(1 - 1/prime(k)^6). - Vaclav Kotesovec, May 02 2020
From Wolfdieter Lang, Sep 16 2020: (Start)
zeta(6) = (1/5!)*Integral_{x=0..infinity} x^5/(exp(x) - 1) dx. See Abramowitz-Stegun, 23.2.7., for s=6, p. 807. See also A337710 for the value of the integral.
zeta(6) = (4/465)*Integral_{x=0..infinity} x^5/(exp(x) + 1) dx. See Abramowitz-Stegun, 23.2.8., for s=6, p. 807. The value of the integral is (31/252)*Pi^6 = 118.2661309... . (End)
From Peter Bala, Apr 27 2025: (Start)
zeta(6) = 1/6! * Integral_{x >= 0} x^6 * exp(x)/(exp(x) - 1)^2 dx = 2^5/(2^5 - 1) * 1/6! * Integral_{x >= 0} x^6 * exp(x)/(exp(x) + 1)^2 dx.
zeta(6) = 1/7! * Integral_{x >= 0} x^7 * exp(x)*(exp(x) + 1) /(exp(x) - 1)^3 dx = 2/(3*7*15*31) * Integral_{x >= 0} x^7 * exp(x)*(exp(x) - 1)/(exp(x) + 1)^3 dx. (End)

cp's OEIS Frontend

A000578 The cubes: a(n) = n^3.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Haskell

Magma

Magma

Maple

Mathematica

Maxima

PARI

PARI

Python

Scheme

Formula

A000035 Period 2: repeat [0, 1]; a(n) = n mod 2; parity of n.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Haskell

Haskell

Maple

Mathematica

Maxima

PARI

PARI

Python

Scheme

Formula

A013661 Decimal expansion of Pi^2/6 = zeta(2) = Sum_{m>=1} 1/m^2.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Magma

Maple

Mathematica

Maxima

PARI

PARI

PARI

PARI

PARI

PARI

Python

Formula

Extensions

A002162 Decimal expansion of the natural logarithm of 2.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A006752 Decimal expansion of Catalan's constant 1 - 1/9 + 1/25 - 1/49 + 1/81 - ...

Views