A063448 -id:A063448 - cp's OEIS frontend

A105724 Duplicate of A063448.

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

Offset: 1

dead

A000290 The squares: a(n) = n^2.

0, 1, 4, 9, 16, 25, 36, 49, 64, 81, 100, 121, 144, 169, 196, 225, 256, 289, 324, 361, 400, 441, 484, 529, 576, 625, 676, 729, 784, 841, 900, 961, 1024, 1089, 1156, 1225, 1296, 1369, 1444, 1521, 1600, 1681, 1764, 1849, 1936, 2025, 2116, 2209, 2304, 2401, 2500

Offset: 0

N. J. A. Sloane

To test if a number is a square, see Cohen, p. 40. - N. J. A. Sloane, Jun 19 2011
Zero followed by partial sums of A005408 (odd numbers). - Jeremy Gardiner, Aug 13 2002
Begin with n, add the next number, subtract the previous number and so on ending with subtracting a 1: a(n) = n + (n+1) - (n-1) + (n+2) - (n-2) + (n+3) - (n-3) + ... + (2n-1) - 1 = n^2. - Amarnath Murthy, Mar 24 2004
Sum of two consecutive triangular numbers A000217. - Lekraj Beedassy, May 14 2004
Numbers with an odd number of divisors: {d(n^2) = A048691(n); for the first occurrence of 2n + 1 divisors, see A071571(n)}. - Lekraj Beedassy, Jun 30 2004
See also A000037.
First sequence ever computed by electronic computer, on EDSAC, May 06 1949 (see Renwick link). - Russ Cox, Apr 20 2006
Numbers k such that the imaginary quadratic field Q(sqrt(-k)) has four units. - Marc LeBrun, Apr 12 2006
For n > 0: number of divisors of (n-1)th power of any squarefree semiprime: a(n) = A000005(A006881(k)^(n-1)); a(n) = A000005(A000400(n-1)) = A000005(A011557(n-1)) = A000005(A001023(n-1)) = A000005(A001024(n-1)). - Reinhard Zumkeller, Mar 04 2007
If a 2-set Y and an (n-2)-set Z are disjoint subsets of an n-set X then a(n-2) is the number of 3-subsets of X intersecting both Y and Z. - Milan Janjic, Sep 19 2007
Numbers a such that a^1/2 + b^1/2 = c^1/2 and a^2 + b = c. - Cino Hilliard, Feb 07 2008 (this comment needs clarification, Joerg Arndt, Sep 12 2013)
Numbers k such that the geometric mean of the divisors of k is an integer. - Ctibor O. Zizka, Jun 26 2008
Equals row sums of triangle A143470. Example: 36 = sum of row 6 terms: (23 + 7 + 3 + 1 + 1 + 1). - Gary W. Adamson, Aug 17 2008
Equals row sums of triangles A143595 and A056944. - Gary W. Adamson, Aug 26 2008
Number of divisors of 6^(n-1) for n > 0. - J. Lowell, Aug 30 2008
Denominators of Lyman spectrum of hydrogen atom. Numerators are A005563. A000290-A005563 = A000012. - Paul Curtz, Nov 06 2008
a(n) is the number of all partitions of the sum 2^2 + 2^2 + ... + 2^2, (n-1) times, into powers of 2. - Valentin Bakoev, Mar 03 2009
a(n) is the maximal number of squares that can be 'on' in an n X n board so that all the squares turn 'off' after applying the operation: in any 2 X 2 sub-board, a square turns from 'on' to 'off' if the other three are off. - Srikanth K S, Jun 25 2009
Zero together with the numbers k such that 2 is the number of perfect partitions of k. - Juri-Stepan Gerasimov, Sep 26 2009
Totally multiplicative sequence with a(p) = p^2 for prime p. - Jaroslav Krizek, Nov 01 2009
Satisfies A(x)/A(x^2), A(x) = A173277: (1, 4, 13, 32, 74, ...). - Gary W. Adamson, Feb 14 2010
Positive members are the integers with an odd number of odd divisors and an even number of even divisors. See also A120349, A120359, A181792, A181793, A181795. - Matthew Vandermast, Nov 14 2010
Besides the first term, this sequence is the denominator of Pi^2/6 = 1 + 1/4 + 1/9 + 1/16 + 1/25 + 1/36 + ... . - Mohammad K. Azarian, Nov 01 2011
Partial sums give A000330. - Omar E. Pol, Jan 12 2013
Drmota, Mauduit, and Rivat proved that the Thue-Morse sequence along the squares is normal; see A228039. - Jonathan Sondow, Sep 03 2013
a(n) can be decomposed into the sum of the four numbers [binomial(n, 1) + binomial(n, 2) + binomial(n-1, 1) + binomial(n-1, 2)] which form a "square" in Pascal's Triangle A007318, or the sum of the two numbers [binomial(n, 2) + binomial(n+1, 2)], or the difference of the two numbers [binomial(n+2, 3) - binomial(n, 3)]. - John Molokach, Sep 26 2013
In terms of triangular tiling, the number of equilateral triangles with side length 1 inside an equilateral triangle with side length n. - K. G. Stier, Oct 30 2013
Number of positive roots in the root systems of type B_n and C_n (when n > 1). - Tom Edgar, Nov 05 2013
Squares of squares (fourth powers) are also called biquadratic numbers: A000583. - M. F. Hasler, Dec 29 2013
For n > 0, a(n) is the largest integer k such that k^2 + n is a multiple of k + n. More generally, for m > 0 and n > 0, the largest integer k such that k^(2*m) + n is a multiple of k + n is given by k = n^(2*m). - Derek Orr, Sep 03 2014
For n > 0, a(n) is the number of compositions of n + 5 into n parts avoiding the part 2. - Milan Janjic, Jan 07 2016
a(n), for n >= 3, is also the number of all connected subtrees of a cycle graph, having n vertices. - Viktar Karatchenia, Mar 02 2016
On every sequence of natural continuous numbers with an even number of elements, the summatory of the second half of the sequence minus the summatory of the first half of the sequence is always a square. Example: Sequence from 61 to 70 has an even number of elements (10). Then 61 + 62 + 63 + 64 + 65 = 315; 66 + 67 + 68 + 69 + 70 = 340; 340 - 315 = 25. (n/2)^2 for n = number of elements. - César Aguilera, Jun 20 2016
On every sequence of natural continuous numbers from n^2 to (n+1)^2, the sum of the differences of pairs of elements of the two halves in every combination possible is always (n+1)^2. - César Aguilera, Jun 24 2016
Suppose two circles with radius 1 are tangent to each other as well as to a line not passing through the point of tangency. Create a third circle tangent to both circles as well as the line. If this process is continued, a(n) for n > 0 is the reciprocals of the radii of the circles, beginning with the largest circle. - Melvin Peralta, Aug 18 2016
Does not satisfy Benford's law [Ross, 2012]. - N. J. A. Sloane, Feb 08 2017
Numerators of the solution to the generalization of the Feynman triangle problem, with an offset of 2. If each vertex of a triangle is joined to the point (1/p) along the opposite side (measured say clockwise), then the area of the inner triangle formed by these lines is equal to (p - 2)^2/(p^2 - p + 1) times the area of the original triangle, p > 2. For example, when p = 3, the ratio of the areas is 1/7. The denominators of the ratio of the areas is given by A002061. [Cook & Wood, 2004] - Joe Marasco, Feb 20 2017
Equals row sums of triangle A004737, n >= 1. - Martin Michael Musatov, Nov 07 2017
Right-hand side of the binomial coefficient identity Sum_{k = 0..n} (-1)^(n+k+1)*binomial(n,k)*binomial(n + k,k)*(n - k) = n^2. - Peter Bala, Jan 12 2022
Conjecture: For n>0, min{k such that there exist subsets A,B of {0,1,2,...,a(n)-1} such that |A|=|B|=k and A+B contains {0,1,2,...,a(n)-1}} = n. - Michael Chu, Mar 09 2022
Number of 3-permutations of n elements avoiding the patterns 132, 213, 321. See Bonichon and Sun. - Michel Marcus, Aug 20 2022
Number of intercalates in cyclic Latin squares of order 2n (cyclic Latin squares of odd order do not have intercalates). - Eduard I. Vatutin, Feb 15 2024
a(n) is the number of ternary strings of length n with at most one 0, exactly one 1, and no restriction on the number of 2's.  For example, a(3)=9, consisting of the 6 permutations of the string 102 and the 3 permutations of the string 122. - Enrique Navarrete, Mar 12 2025

			For n = 8, a(8) = 8 * 15 - (1 + 3 + 5 + 7 + 9 + 11 + 13) - 7 = 8 * 15 - 49 - 7 = 64. - _Bruno Berselli_, May 04 2010
G.f. = x + 4*x^2 + 9*x^3 + 16*x^4 + 25*x^5 + 36*x^6 + 49*x^7 + 64*x^8 + 81*x^9 + ...
a(4) = 16. For n = 4 vertices, the cycle graph C4 is A-B-C-D-A. The subtrees are: 4 singles: A, B, C, D; 4 pairs: A-B, BC, C-D, A-D; 4 triples: A-B-C, B-C-D, C-D-A, D-A-B; 4 quads: A-B-C-D, B-C-D-A, C-D-A-B, D-A-B-C; 4 + 4 + 4 + 4 = 16. - _Viktar Karatchenia_, Mar 02 2016

G. L. Alexanderson et al., The William Lowell Putnam Mathematical Competition, Problems and Solutions: 1965-1984, "December 1967 Problem B4(a)", pp. 8(157) MAA Washington DC 1985.
T. M. Apostol, Introduction to Analytic Number Theory, Springer-Verlag, 1976, page 2.
Albert H. Beiler, Recreations in the theory of numbers, New York, Dover, (2nd ed.) 1966. See Chapter XV, pp. 135-167.
R. P. Burn & A. Chetwynd, A Cascade Of Numbers, "The prison door problem" Problem 4 pp. 5-7; 79-80 Arnold London 1996.
H. Cohen, A Course in Computational Algebraic Number Theory, Springer, 1996, p. 40.
John H. Conway and Richard K. Guy, The Book of Numbers, New York: Springer-Verlag, 1996. See pp. 31, 36, 38, 63.
E. Deza and M. M. Deza, Figurate numbers, World Scientific Publishing (2012), p. 6.
M. Gardner, Time Travel and Other Mathematical Bewilderments, Chapter 6 pp. 71-2, W. H. Freeman NY 1988.
Granino A. Korn and Theresa M. Korn, Mathematical Handbook for Scientists and Engineers, McGraw-Hill Book Company, New York (1968), p. 982.
Jan Gullberg, Mathematics from the Birth of Numbers, W. W. Norton & Co., NY & London, 1997, §8.1 Terminology and §8.6 Figurate Numbers, pp. 264, 290-291.
Alfred S. Posamentier, The Art of Problem Solving, Section 2.4 "The Long Cell Block" pp. 10-1; 12; 156-7 Corwin Press Thousand Oaks CA 1996.
Alfred S. Posamentier, Math Charmers, Tantalizing Tidbits for the Mind, Prometheus Books, NY, 2003, pages 35, 52-53, 129-132, 244.
Michel Rigo, Formal Languages, Automata and Numeration Systems, 2 vols., Wiley, 2014. Mentions this sequence - see "List of Sequences" in Vol. 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).
J. K. Strayer, Elementary Number Theory, Exercise Set 3.3 Problems 32, 33, p. 88, PWS Publishing Co. Boston MA 1996.
C. W. Trigg, Mathematical Quickies, "The Lucky Prisoners" Problem 141 pp. 40, 141, Dover NY 1985.
R. Vakil, A Mathematical Mosaic, "The Painted Lockers" pp. 127;134 Brendan Kelly Burlington Ontario 1996.
David Wells, The Penguin Dictionary of Curious and Interesting Numbers. Penguin Books, NY, 1986, Revised edition 1987. See p. 123.

Franklin T. Adams-Watters, The first 10000 squares: Table of n, n^2 for n = 0..10000
Valentin P. Bakoev, Algorithmic approach to counting of certain types m-ary partitions, Discrete Mathematics, 275 (2004) pp. 17-41.
Stefano Barbero, Umberto Cerruti, and Nadir Murru, Transforming Recurrent Sequences by Using the Binomial and Invert Operators, J. Int. Seq. 13 (2010) # 10.7.7, section 4.4.
Anicius Manlius Severinus Boethius, De institutione arithmetica libri duo, Book 2, sections 10-12.
Nicolas Bonichon and Pierre-Jean Morel, Baxter d-permutations and other pattern avoiding classes, arXiv:2202.12677 [math.CO], 2022.
Henry Bottomley, Some Smarandache-type multiplicative sequences.
R. J. Cook and G. V. Wood, Feynman's Triangle, Mathematical Gazette, 88:299-302 (2004).
John Derbyshire, Monkeys and Doors.
Michael Drmota, Christian Mauduit, and Joël Rivat, The Thue-Morse Sequence Along The Squares is Normal, Abstract, ÖMG-DMV Congress, 2013.
Ralph Greenberg, Math for Poets.
Guo-Niu Han, Enumeration of Standard Puzzles.
Guo-Niu Han, Enumeration of Standard Puzzles. [Cached copy]
Vi Hart, Doodling in Math Class: Connecting Dots (2012) [Video].
Nick Hobson, Python program to determine whether an integer is in sequence A000290.
INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 338.
Milan Janjic, Enumerative Formulas for Some Functions on Finite Sets.
Milan Janjic, Two Enumerative Functions.
Milan Janjić, On Restricted Ternary Words and Insets, arXiv:1905.04465 [math.CO], 2019.
L. B. W. Jolley, Summation of Series, Dover, 1961.
Sameen Ahmed Khan, Sums of the powers of reciprocals of polygonal numbers, Int'l J. of Appl. Math. (2020) Vol. 33, No. 2, 265-282.
Clark Kimberling, Complementary Equations, Journal of Integer Sequences, Vol. 10 (2007), Article 07.1.4.
Hyun Kwang Kim, On Regular Polytope Numbers, Proc. Amer. Math. Soc., 131 (2002), 65-75.
J. H. McKay, The William Lowell Putnam Mathematical Competition, Problem B4(a), The American Mathematical Monthly, vol. 75, no. 7, 1968, pp. 732-739.
Matthew Parker, The first million squares (7-Zip compressed file).
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; arXiv:0911.4975 [math.NT], 2009.
Omar E. Pol, Illustration of initial terms of A000217, A000290, A000326, A000384, A000566, A000567.
Yash Puri and Thomas Ward, Arithmetic and growth of periodic orbits, J. Integer Seqs., Vol. 4 (2001), #01.2.1.
Franck Ramaharo, A generating polynomial for the pretzel knot, arXiv:1805.10680 [math.CO], 2018.
William S. Renwick, The start of the EDSAC log.
Luis Manuel Rivera, Integer sequences and k-commuting permutations, arXiv preprint arXiv:1406.3081 [math.CO], 2014.
Kenneth A. Ross, First Digits of Squares and Cubes, Math. Mag. 85 (2012) 36-42.
John Scholes, 28th Putnam 1967 Prob.B4(a).
James A. Sellers, Partitions Excluding Specific Polygonal Numbers As Parts, Journal of Integer Sequences, Vol. 7 (2004), Article 04.2.4.
N. J. A. Sloane, Illustration of initial terms of A000217, A000290, A000326.
Michael Somos, Rational Function Multiplicative Coefficients.
Nathan Sun, On d-permutations and Pattern Avoidance Classes, arXiv:2208.08506 [math.CO], 2022.
Dinoj Surendran, Chimbumu and Chickwama get out of jail.
Eric Weisstein's World of Mathematics, Square Number.
Eric Weisstein's World of Mathematics, Unit.
Eric Weisstein's World of Mathematics, Wiener Index.
Index entries for "core" sequences.
Index entries for linear recurrences with constant coefficients, signature (3,-3,1).
Index entries for two-way infinite sequences.
Index to sequences related to polygonal numbers.
Index entries for sequences related to Benford's law.

Cf. A092205, A128200, A005408, A128201, A002522, A005563, A008865, A059100, A143051, A143470, A143595, A056944, A001157 (inverse Möbius transform), A001788 (binomial transform), A228039, A001105, A004159, A159918, A173277, A095794, A162395, A186646 (Pisano periods), A028338 (2nd diagonal).
A row or column of A132191.
This sequence is related to partitions of 2^n into powers of 2, as it is shown in A002577. So A002577 connects the squares and A000447. - Valentin Bakoev, Mar 03 2009
Boustrophedon transforms: A000697, A000745.
Cf. A342819.
Cf. A013661.

a000290 = (^ 2)
a000290_list = scanl (+) 0 [1,3..]  -- Reinhard Zumkeller, Apr 06 2012

Magma
```
[ n^2 : n in [0..1000]];
```

A000290 := n->n^2; seq(A000290(n), n=0..50);
A000290 := -(1+z)/(z-1)^3; # Simon Plouffe, in his 1992 dissertation, for sequence starting at a(1)

Array[#^2 &, 51, 0] (* Robert G. Wilson v, Aug 01 2014 *)
LinearRecurrence[{3, -3, 1}, {0, 1, 4}, 60] (* Vincenzo Librandi, Jul 24 2015 *)
CoefficientList[Series[-(x^2 + x)/(x - 1)^3, {x, 0, 50}], x] (* Robert G. Wilson v, Jul 23 2018 *)
Range[0, 99]^2 (* Alonso del Arte, Nov 21 2019 *)
Join[{0},Accumulate[Range[1,101,2]]] (* Harvey P. Dale, May 11 2025 *)

A000290(n):=n^2$ makelist(A000290(n),n,0,30); /* Martin Ettl, Oct 25 2012 */

PARI
```
{a(n) = n^2};
```

b000290(maxn)=for(n=0,maxn,print(n," ",n^2);) \\ Anatoly E. Voevudko, Nov 11 2015

Python
```
# See Hobson link
```

def A000290(n): return n**2 # Chai Wah Wu, Nov 13 2022

(0 to 59).map(n => n * n) // Alonso del Arte, Oct 07 2019

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

G.f.: x*(1 + x) / (1 - x)^3.
E.g.f.: exp(x)*(x + x^2).
Dirichlet g.f.: zeta(s-2).
a(n) = a(-n).
Multiplicative with a(p^e) = p^(2*e). - David W. Wilson, Aug 01 2001
Sum of all matrix elements M(i, j) = 2*i/(i+j) (i, j = 1..n). a(n) = Sum_{i = 1..n} Sum_{j = 1..n} 2*i/(i + j). - Alexander Adamchuk, Oct 24 2004
a(0) = 0, a(1) = 1, a(n) = 2*a(n-1) - a(n-2) + 2. - Miklos Kristof, Mar 09 2005
From Pierre CAMI, Oct 22 2006: (Start)
a(n) is the sum of the odd numbers from 1 to 2*n - 1.
a(0) = 0, a(1) = 1, then a(n) = a(n-1) + 2*n - 1. (End)
For n > 0: a(n) = A130064(n)*A130065(n). - Reinhard Zumkeller, May 05 2007
a(n) = Sum_{k = 1..n} A002024(n, k). - Reinhard Zumkeller, Jun 24 2007
Left edge of the triangle in A132111: a(n) = A132111(n, 0). - Reinhard Zumkeller, Aug 10 2007
Binomial transform of [1, 3, 2, 0, 0, 0, ...]. - Gary W. Adamson, Nov 21 2007
a(n) = binomial(n+1, 2) + binomial(n, 2).
This sequence could be derived from the following general formula (cf. A001286, A000330): n*(n+1)*...*(n+k)*(n + (n+1) + ... + (n+k))/((k+2)!*(k+1)/2) at k = 0. Indeed, using the formula for the sum of the arithmetic progression (n + (n+1) + ... + (n+k)) = (2*n + k)*(k + 1)/2 the general formula could be rewritten as: n*(n+1)*...*(n+k)*(2*n+k)/(k+2)! so for k = 0 above general formula degenerates to n*(2*n + 0)/(0 + 2) = n^2. - Alexander R. Povolotsky, May 18 2008
From a(4) recurrence formula a(n+3) = 3*a(n+2) - 3*a(n+1) + a(n) and a(1) = 1, a(2) = 4, a(3) = 9. - Artur Jasinski, Oct 21 2008
The recurrence a(n+3) = 3*a(n+2) - 3*a(n+1) + a(n) is satisfied by all k-gonal sequences from a(3), with a(0) = 0, a(1) = 1, a(2) = k. - Jaume Oliver Lafont, Nov 18 2008
a(n) = floor(n*(n+1)*(Sum_{i = 1..n} 1/(n*(n+1)))). - Ctibor O. Zizka, Mar 07 2009
Product_{i >= 2} 1 - 2/a(i) = -sin(A063448)/A063448. - R. J. Mathar, Mar 12 2009
a(n) = A002378(n-1) + n. - Jaroslav Krizek, Jun 14 2009
a(n) = n*A005408(n-1) - (Sum_{i = 1..n-2} A005408(i)) - (n-1) = n*A005408(n-1) - a(n-1) - (n-1). - Bruno Berselli, May 04 2010
a(n) == 1 (mod n+1). - Bruno Berselli, Jun 03 2010
a(n) = a(n-1) + a(n-2) - a(n-3) + 4, n > 2. - Gary Detlefs, Sep 07 2010
a(n+1) = Integral_{x >= 0} exp(-x)/( (Pn(x)*exp(-x)*Ei(x) - Qn(x))^2 +(Pi*exp(-x)*Pn(x))^2 ), with Pn the Laguerre polynomial of order n and Qn the secondary Laguerre polynomial defined by Qn(x) = Integral_{t >= 0} (Pn(x) - Pn(t))*exp(-t)/(x-t). - Groux Roland, Dec 08 2010
Euler transform of length-2 sequence [4, -1]. - Michael Somos, Feb 12 2011
A162395(n) = -(-1)^n * a(n). - Michael Somos, Mar 19 2011
a(n) = A004201(A000217(n)); A007606(a(n)) = A000384(n); A007607(a(n)) = A001105(n). - Reinhard Zumkeller, Feb 12 2011
Sum_{n >= 1} 1/a(n)^k = (2*Pi)^k*B_k/(2*k!) = zeta(2*k) with Bernoulli numbers B_k = -1, 1/6, 1/30, 1/42, ... for k >= 0. See A019673, A195055/10 etc. [Jolley eq 319].
Sum_{n>=1} (-1)^(n+1)/a(n)^k = 2^(k-1)*Pi^k*(1-1/2^(k-1))*B_k/k! [Jolley eq 320] with B_k as above.
A007968(a(n)) = 0. - Reinhard Zumkeller, Jun 18 2011
A071974(a(n)) = n; A071975(a(n)) = 1. - Reinhard Zumkeller, Jul 10 2011
a(n) = A199332(2*n - 1, n). - Reinhard Zumkeller, Nov 23 2011
For n >= 1, a(n) = Sum_{d|n} phi(d)*psi(d), where phi is A000010 and psi is A001615. - Enrique Pérez Herrero, Feb 29 2012
a(n) = A000217(n^2) - A000217(n^2 - 1), for n > 0. - Ivan N. Ianakiev, May 30 2012
a(n) = (A000217(n) + A000326(n))/2. - Omar E. Pol, Jan 11 2013
a(n) = A162610(n, n) = A209297(n, n) for n > 0. - Reinhard Zumkeller, Jan 19 2013
a(A000217(n)) = Sum_{i = 1..n} Sum_{j = 1..n} i*j, for n > 0. - Ivan N. Ianakiev, Apr 20 2013
a(n) = A133280(A000217(n)). - Ivan N. Ianakiev, Aug 13 2013
a(2*a(n)+2*n+1) = a(2*a(n)+2*n) + a(2*n+1). - Vladimir Shevelev, Jan 24 2014
a(n+1) = Sum_{t1+2*t2+...+n*tn = n} (-1)^(n+t1+t2+...+tn)*multinomial(t1+t2 +...+tn,t1,t2,...,tn)*4^(t1)*7^(t2)*8^(t3+...+tn). - Mircea Merca, Feb 27 2014
a(n) = floor(1/(1-cos(1/n)))/2 = floor(1/(1-n*sin(1/n)))/6, n > 0. - Clark Kimberling, Oct 08 2014
a(n) = ceiling(Sum_{k >= 1} log(k)/k^(1+1/n)) = -Zeta'[1+1/n]. Thus any exponent greater than 1 applied to k yields convergence. The fractional portion declines from A073002 = 0.93754... at n = 1 and converges slowly to 0.9271841545163232... for large n. - Richard R. Forberg, Dec 24 2014
a(n) = Sum_{j = 1..n} Sum_{i = 1..n} ceiling((i + j - n + 1)/3). - Wesley Ivan Hurt, Mar 12 2015
a(n) = Product_{j = 1..n-1} 2 - 2*cos(2*j*Pi/n). - Michel Marcus, Jul 24 2015
From Ilya Gutkovskiy, Jun 21 2016: (Start)
Product_{n >= 1} (1 + 1/a(n)) = sinh(Pi)/Pi = A156648.
Sum_{n >= 0} 1/a(n!) = BesselI(0, 2) = A070910. (End)
a(n) = A028338(n, n-1), n >= 1 (second diagonal). - Wolfdieter Lang, Jul 21 2017
For n >= 1, a(n) = Sum_{d|n} sigma_2(d)*mu(n/d) = Sum_{d|n} A001157(d)*A008683(n/d). - Ridouane Oudra, Apr 15 2021
a(n) = Sum_{i = 1..2*n-1} ceiling(n - i/2). - Stefano Spezia, Apr 16 2021
From Richard L. Ollerton, May 09 2021: (Start) For n >= 1,
a(n) = Sum_{k=1..n} psi(n/gcd(n,k)).
a(n) = Sum_{k=1..n} psi(gcd(n,k))*phi(gcd(n,k))/phi(n/gcd(n,k)).
a(n) = Sum_{k=1..n} sigma_2(n/gcd(n,k))*mu(gcd(n,k))/phi(n/gcd(n,k)).
a(n) = Sum_{k=1..n} sigma_2(gcd(n,k))*mu(n/gcd(n,k))/phi(n/gcd(n,k)). (End)
a(n) = (A005449(n) + A000326(n))/3. - Klaus Purath, May 13 2021
Let T(n) = A000217(n), then a(T(n)) + a(T(n+1)) = T(a(n+1)). - Charlie Marion, Jun 27 2022
a(n) = Sum_{k=1..n} sigma_1(k) + Sum_{i=1..n} (n mod i). - Vadim Kataev, Dec 07 2022
a(n^2) + a(n^2+1) + ... + a(n^2+n) + 4*A000537(n) = a(n^2+n+1) + ... + a(n^2+2n).  In general, if P(k,n) = the n-th k-gonal number, then P(2k,n^2) + P(2k,n^2+1) + ... + P(2k,n^2+n) + 4*(k-1)*A000537(n) = P(2k,n^2+n+1) + ... + P(2k,n^2+2n). - Charlie Marion, Apr 26 2024
Sum_{n>=1} 1/a(n) = A013661. - Alois P. Heinz, Oct 19 2024
a(n) = 1 + 3^3*((n-1)/(n+1))^2 + 5^3*((n-1)*(n-2)/((n+1)*(n+2)))^2 + 7^3*((n-1)*(n-2)*(n-3)/((n+1)*(n+2)*(n+3)))^2 + ... for n >= 1. - Peter Bala, Dec 09 2024

Incorrect comment and example removed by Joerg Arndt, Mar 11 2010

A068466 Decimal expansion of Gamma(1/4).

Original entry on oeis.org

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

Offset: 1

Benoit Cloitre, Mar 10 2002

Nesterenko proves that this constant is transcendental (he cites Chudnovsky as the first to show this); in fact it is algebraically independent of Pi and e^Pi over Q. - Charles R Greathouse IV, Nov 11 2013

			3.6256099082219083119306851558676720029951676828800654674333...

Steven R. Finch, Mathematical Constants, Encyclopedia of Mathematics and its Applications, vol. 94, Cambridge University Press, 2003, Section 1.5.4, p. 33.
Jerome Spanier and Keith B. Oldham, "Atlas of Functions", Hemisphere Publishing Corp., 1987, chapter 43, equation 43:4:13 at page 414.

Harry J. Smith, Table of n, a(n) for n = 1..1000
William Duke and Özlem Imamoḡlu, Special values of multiple gamma functions, Journal de théorie des nombres de Bordeaux, Vol. 18. No. 1 (2006), pp. 113-123.
Greg J. Fee and Simon Plouffe, Gamma(1/4) to 25000 digits.
Yu. V. Nesterenko, Modular functions and transcendence questions, Sbornik: Mathematics, Vol. 187, No. 9 (1996), pp. 1319-1348. (English translation)
Simon Plouffe, Gamma(1/4) to 250000 digits.
Dan Romik, On Viazovska's modular form inequalities, arXiv:2303.13427 [math.NT], 2023.
Eric Weisstein's World of Mathematics, Gamma Function.
Wikipedia, Particular values of the Gamma function: General rational arguments.
Index to sequences related to the Gamma function.
Index entries for transcendental numbers.

Cf. A014549, A248557.

R:= RealField(100); SetDefaultRealField(R); Gamma(1/4); // G. C. Greubel, Mar 10 2018

Maple
```
evalf(GAMMA(1/4));
```

RealDigits[Gamma[1/4], 10, 110][[1]] (* Bruno Berselli, Dec 13 2012 *)

default(realprecision, 1080); x=gamma(1/4); for (n=1, 1000, d=floor(x); x=(x-d)*10; write("b068466.txt", n, " ", d)); \\ Harry J. Smith, Apr 19 2009

From Amiram Eldar, Jun 12 2021: (Start)
Equals sqrt(2*sqrt(2*Pi^3)*G), where G is Gauss's constant (A014549).
Equals (2*Pi)^(3/4) * Product_{k>=1} tanh(k*Pi/2) (Duke and Imamoḡlu, 2006). (End)
Gamma(1/4) * A068465 = A063448. - R. J. Mathar, May 22 2024
Equals Product_{n>=1} exp((2*(6*n + 1)*(1 - beta(n)) - (eta(n) - 1))/(4*n)), where eta(n) and beta(n) are the Dirichlet eta and beta functions, respectively. - Antonio Graciá Llorente, Sep 05 2024

A068465 Decimal expansion of Gamma(3/4).

Original entry on oeis.org

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

Offset: 1

Benoit Cloitre, Mar 10 2002

			Gamma(3/4) = 1.225416702465177645129098303362890526851239248108070611...

Jerome Spanier and Keith B. Oldham, "Atlas of Functions", Hemisphere Publishing Corp., 1987, chapter 43, equation 43:4:14 at page 414.

G. C. Greubel, Table of n, a(n) for n = 1..20000
Russell J. Matheson, GAMMA(3/4) computed to 14550 digits.
Simon Plouffe, GAMMA(3/4) to 256 places, see p. 65.
Index to sequences related to the Gamma function

Cf. A000796, A002193, A053004, A063448, A068466, A069998.

SetDefaultRealField(RealField(105)); Gamma(3/4); // G. C. Greubel, Mar 11 2018

evalf(GAMMA(3/4)) ; # R. J. Mathar, Jan 10 2013

RealDigits[Gamma[3/4], 10, 100][[1]] (* G. C. Greubel, Mar 11 2018 *)

default(realprecision, 100); gamma(3/4) \\ G. C. Greubel, Mar 11 2018

Gamma(3/4) * A068466 = sqrt(2)*Pi = A063448. - R. J. Mathar, Jun 18 2006
Equals Integral_{x>=0} x^(-1/4)*exp(-x) dx. - Vaclav Kotesovec, Nov 12 2020
Equals (Pi/2)^(1/4) * sqrt(AGM(1,sqrt(2))) = sqrt(A069998 * A053004). - Amiram Eldar, Jun 12 2021

A093954 Decimal expansion of Pi/(2*sqrt(2)).

Original entry on oeis.org

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

Offset: 1

Eric W. Weisstein, Apr 19 2004

The value is the length Pi*sqrt(2)/4 of the diagonal in the square with side length Pi/4 = Sum_{n>=0} (-1)^n/(2n+1) = A003881. The area of the circumcircle of this square is Pi*(Pi*sqrt(2)/8)^2 = Pi^3/32 = A153071. - Eric Desbiaux, Jan 18 2009
This is the value of the Dirichlet L-function of modulus m=8 at argument s=1 for the non-principal character (1,0,1,0,-1,0,-1,0). See arXiv:1008.2547. - R. J. Mathar, Mar 22 2011
Archimedes's-like scheme: set p(0) = sqrt(2), q(0) = 1; p(n+1) = 2*p(n)*q(n)/(p(n)+q(n)) (harmonic mean, i.e., 1/p(n+1) = (1/p(n) + 1/q(n))/2), q(n+1) = sqrt(p(n+1)*q(n)) (geometric mean, i.e., log(q(n+1)) = (log(p(n+1)) + log(q(n)))/2), for n >= 0. The error of p(n) and q(n) decreases by a factor of approximately 4 each iteration, i.e., approximately 2 bits are gained by each iteration. Set r(n) = (2*q(n) + p(n))/3, the error decreases by a factor of approximately 16 for each iteration, i.e., approximately 4 bits are gained by each iteration. For a similar scheme see also A244644. - A.H.M. Smeets, Jul 12 2018
The area of a circle circumscribing a unit-area regular octagon. - Amiram Eldar, Nov 05 2020

			1.11072073453959156175397...
From _Peter Bala_, Mar 03 2015: (Start)
Asymptotic expansion at n = 5000.
The truncated series Sum_{k = 0..5000 - 1} (-1)^floor(k/2)/(2*k + 1) = 1.110(6)207345(42)591561(18)3970(5238)1.... The bracketed digits show where this decimal expansion differs from that of Pi/(2*sqrt(2)). The numbers 1, -3, 57, -2763 must be added to the bracketed numbers to give the correct decimal expansion to 30 digits: Pi/(2*sqrt(2)) = 1.110(7)207345(39)591561(75)3970 (2475)1.... (End)
From _Peter Bala_, Nov 24 2016: (Start)
Case m = 1, n = 1:
Pi/(2*sqrt(2)) = 4*Sum_{k >= 0} (-1)^(1 + floor(k/2))/((2*k - 1)*(2*k + 1)*(2*k + 3)).
We appear to have the following asymptotic expansion for the tails of this series: for N divisible by 4, Sum_{k >= N/2} (-1)^floor(k/2)/((2*k - 1)*(2*k + 1)*(2*k + 3)) ~ 1/N^3 - 14/N^5 + 691/N^7 - 62684/N^9 - ..., where the coefficient sequence [1, 0, -14, 0, 691, 0, -62684, ...] appears to come from the e.g.f. (1/2!)*cosh(x)/cosh(2*x)*sinh(x)^2 = x^2/2! - 14*x^4/4! + 691*x^6/6! - 62684*x^8/8! + .... Cf. A019670.
For example, take N = 10^5. The truncated series Sum_{k = 0..N/2 -1} (-1)^(1+floor(k/2))/((2*k - 1)*(2*k + 1)*(2*k + 3)) = 0.27768018363489(8)89043849(11)61878(80026)6163(351171)58.... The bracketed digits show where this decimal expansion differs from that of (1/4)*Pi/(2*sqrt(2)). The numbers -1, 14, -691, 62684 must be added to the bracketed numbers to give the correct decimal expansion: (1/4)*Pi/(2*sqrt(2)) = 0.27768018363489(7) 89043849(25)61878(79335)6163(413855)58... (End)

J. M. Arnaudiès, P. Delezoide et H. Fraysse, Exercices résolus d'Analyse du cours de mathématiques - 2, Dunod, 1993, Exercice 5, p. 240.
George Boros and Victor H. Moll, Irresistible integrals, Cambridge University Press, 2006, p. 149.
Steven R. Finch, Mathematical Constants, Encyclopedia of Mathematics and its Applications, vol. 94, Cambridge University Press, 2003, Section 1.4.1, p. 20.
L. B. W. Jolley, Summation of Series, Dover, 1961, eq. 76, page 16.
Joel L. Schiff, The Laplace Transform: Theory and Applications, Springer-Verlag New York, Inc. (1999). See p. 149.
David Wells, The Penguin Dictionary of Curious and Interesting Numbers. Penguin Books, NY, 1986, Revised edition 1987. See p. 53.

Harry J. Smith, Table of n, a(n) for n = 1..20000
J. M. Borwein, P. B. Borwein, and K. Dilcher, Pi, Euler numbers and asymptotic expansions, Amer. Math. Monthly, 96 (1989), 681-687.
R. J. Mathar, Table of Dirichlet L-series and prime zeta modulo functions for small moduli, arXiv:1008.2547 [math.NT], 2010-2015, table 7 and section 2.2, value of L(m=8,r=4,s=1).
Michael Penn, Newton's sum (2023), YouTube video.
Michael I. Shamos, A catalog of the real numbers, (2007). See p. 149.
Eric Weisstein's World of Mathematics, Bifoliate.
Index entries for transcendental numbers.

Cf. A161684 (continued fraction).
Cf. A002388, A019670.
Cf. A000281, A063448, A247719, A193887, A244976, A181048, A181049.
Cf. A003881, A251809, A188510.
Cf. A352324, A248897, A019669.

simplify( sum((cos((1/2)*k*Pi)+sin((1/2)*k*Pi))/(2*k+1), k = 0 .. infinity) );  # Peter Bala, Mar 09 2015

RealDigits[Pi/Sqrt@8, 10, 111][[1]] (* Michael De Vlieger, Sep 23 2016 and slightly modified by Robert G. Wilson v, Jul 23 2018 *)

default(realprecision, 20080); x=Pi*sqrt(2)/4; for (n=1, 20000, d=floor(x); x=(x-d)*10; write("b093954.txt", n, " ", d)); \\ Harry J. Smith, Jun 17 2009

Equals 1/A112628.
Equals Integral_{x=0..oo} 1/(x^4+1) dx. - Jean-François Alcover, Apr 29 2013
From Peter Bala, Feb 05 2015: (Start)
Pi/(2*sqrt(2)) = Sum_{k >= 0} binomial(2*k,k)*1/(2*k + 1)*(1/8)^k.
The integer sequences A(n) := 2^n*(2*n + 1)! and B(n) := A(n)*( Sum {k = 0..n} binomial(2*k,k)*1/(2*k + 1)*(1/8)^k ) both satisfy the second order recurrence equation u(n) = (12*n^2 + 1)*u(n-1) - 4*(n - 1)*(2*n - 1)^3*u(n-2). From this observation we can obtain the continued fraction expansion Pi/(2*sqrt(2)) = 1 + 1/(12 - 4*3^3/(49 - 4*2*5^3/(109 - 4*3*7^3/(193 - ... - 4*(n - 1)*(2*n - 1)^3/((12*n^2 + 1) - ... ))))). Cf. A002388 and A019670. (End)
From Peter Bala, Mar 03 2015: (Start)
Pi/(2*sqrt(2)) = Sum_{k >= 0} (-1)^floor(k/2)/(2*k + 1) = limit (n -> infinity) Sum_{k = -n .. n - 1} (-1)^k/(4*k + 1). See Wells.
We conjecture the asymptotic expansion Pi/(2*sqrt(2)) - Sum {k = 0..n - 1} (-1)^floor(k/2)/(2*k + 1) ~ 1/(2*n) - 3/(2*n)^3 + 57/(2*n)^5 - 2763/(2*n)^7 + ..., where n is a multiple of 4 and the sequence of unsigned coefficients [1, 3, 57, 2763, ...] is A000281. An example with n = 5000 is given below. (End)
From Peter Bala, Sep 21 2016: (Start)
c = 2 * Sum_{k >= 0} (-1)^k * (4*k + 2)/((4*k + 1)*(4*k + 3)) = A181048 + A181049. The asymptotic expansion conjectured above follows from the asymptotic expansions given in A181048 and A181049.
c = 1/2 * Integral_{x = 0..Pi/2} sqrt(tan(x)) dx. (End)
From Peter Bala, Nov 24 2016: (Start)
Let m be an odd integer and n a nonnegative integer. Then Pi/(2*sqrt(2)) = 2^n*m^(2*n)*(2*n)!*Sum_{k >= 0} (-1)^(n+floor(k/2)) * 1/Product_{j = -n..n} (2*k + 1 + 2*m*j). Cf. A003881.
In the particular case m = 1 the result has the equivalent form: for n a nonnegative integer, Pi/(2*sqrt(2)) = 2^n*(2*n)!*Sum_{k >= 0} (-1)^(n+k)*(8*k + 4)* 1/Product_{j = -n..n+1} (4*k + 2*j + 1). The case m = 1, n = 1 is considered in the Example section below.
Let m be an odd integer and n a nonnegative integer. Then Pi/(2*sqrt(2)) = 4^n*m^(2*n)*(2*n)!*Sum_{k >= 0} (-1)^(n+floor(k/2)) * 1/Product_{j = -n..n} (2*k + 1 + 4*m*j). (End)
Equals Integral_{x = 0..oo} cosh(x)/cosh(2*x) dx. - Peter Bala, Nov 01 2019
Equals Sum_{k>=1} A188510(k)/k = Sum_{k>=1} Kronecker(-8,k)/k = 1 + 1/3 - 1/5 - 1/7 + 1/9 + 1/11 - 1/13 - 1/15 + ... - Jianing Song, Nov 16 2019
From Amiram Eldar, Jul 16 2020: (Start)
Equals Product_{k>=1} (1 - (-1)^k/(2*k+1)).
Equals Integral_{x=0..oo} dx/(x^2 + 2).
Equals Integral_{x=0..Pi/2} dx/(sin(x)^2 + 1). (End)
Equals Integral_{x=0..oo} x^2/(x^4 + 1) dx (Arnaudiès). - Bernard Schott, May 19 2022
Equals Integral_{x = 0..1} 1/(2*x^2 + (1 - x)^2) dx. - Peter Bala, Jul 22 2022
Equals Integral_{x = 0..1} 1/(1 - x^4)^(1/4) dx. - Terry D. Grant, Mar 17 2023
Equals 1/Product_{p prime} (1 - Kronecker(-8,p)/p), where Kronecker(-8,p) = 0 if p = 2, 1 if p == 1 or 3 (mod 8) or -1 if p == 5 or 7 (mod 8). - Amiram Eldar, Dec 17 2023
Equals A068465*A068467. - R. J. Mathar, Jun 27 2024
From Stefano Spezia, Jun 05 2025: (Start)
Equals Sum_{k>=1} (-1)^(k+1)(1/(4*k - 3) + 1/(4*k - 1)).
Equals Product_{k=0..oo} (1 + (-1)^k/(2*k + 3)).
Equals Integral_{x=0..oo} 1/(2*x^2 + 1).
Equals Integral_{x=0..1} 1/((1 + x^2)*sqrt(1 - x^2)). (End)

A175380 Decimal expansion of Gamma(1/5).

Original entry on oeis.org

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

Offset: 1

R. J. Mathar, Apr 24 2010

			Equals 4.590843711998803053204758275929152...

G. C. Greubel, Table of n, a(n) for n = 1..5000
R. Vidunas, Expressions for values of the Gamma function, arxiv:math/0403510 [math.CA], 2004.
Wikipedia, Particular values of the Gamma function: General rational arguments
Index to sequences related to the gamma function

SetDefaultRealField(RealField(100)); Gamma(1/5); // G. C. Greubel, Mar 10 2018

Maple
```
evalf(GAMMA(1/5));
```

RealDigits[Gamma[1/5],10,120][[1]] (* Harvey P. Dale, May 26 2011 *)

gamma(1/5) \\ G. C. Greubel, Jan 15 2017

Equals Pi * sqrt(2) * sqrt(5 + sqrt(5)) / (sqrt(5) * Gamma(4/5) ) = A063448 * sqrt(5 + A002163) / (A002163 * Gamma(4/5)) where Gamma(4/5) = A340722.

A247719 Decimal expansion of Integral_{t=0..Pi/2} sqrt(tan(t)) dt.

Original entry on oeis.org

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

Offset: 1

Jean-François Alcover, Sep 23 2014

			2.22144146907918312350794049503034684930731...

G. C. Greubel, Table of n, a(n) for n = 1..10000
D. H. Bailey and J. M. Borwein, Highly Parallel, High-Precision Numerical Integration p. 7. (2005) Lawrence Berkeley National Laboratory.
Philippe Flajolet and Robert Sedgewick, Analytic Combinatorics, Cambridge Univ. Press, 2009, pp. 235-236.

Cf. A063448, A093954, A193887, A244976, A181048, A181049, A186706.

SetDefaultRealField(RealField(100)); R:= RealField(); Pi(R)/Sqrt(2); // G. C. Greubel, Sep 07 2018

RealDigits[Pi/Sqrt[2], 10, 104] // First

default(realprecision, 100); Pi/sqrt(2) \\ G. C. Greubel, Sep 07 2018

Equals Pi/sqrt(2).
Equals A063448/2.
c = 2*( Sum_{k >= 0} (-1)^k/(4*k + 1) + Sum_{k >= 0} (-1)^k/(4*k + 3) ) = 2*(A181048 + A181049). - Peter Bala, Sep 21 2016
From Amiram Eldar, Aug 07 2020: (Start)
Equals Integral_{x=0..Pi} 1/(cos(x)^2 + 1) dx = Integral_{x=0..Pi} 1/(sin(x)^2 + 1) dx.
Equals Integral_{x=-oo..oo} 1/(x^4 + 1) dx.
Equals Integral_{x=-oo..oo} x^2/(x^4 + 1) dx.
Equals Integral_{x=0..oo} log(1 + 1/(2 * x^2)) dx. (End)
Equals Integral_{x=0..2*Pi} 1/(3 + sin(x)) dx; since for a>1: Integral_{x=0..2*Pi} 1/(a + sin(x)) dx = 2*Pi/sqrt(a^2-1). - Bernard Schott, Feb 19 2023
Equals 20/9 - 160*Sum_{n >= 1} 1/((64*n^2 - 1)*(64*n^2 - 4)*(64*n^2 - 9)). - Peter Bala, Nov 09 2023

A244976 Decimal expansion of Pi/(8*sqrt(2)).

Original entry on oeis.org

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

Offset: 0

Jean-François Alcover, Jul 09 2014

			0.277680183634897890438492561878793356163413855585980638942837225434777...

George Boros and Victor H. Moll, Irresistible integrals, Cambridge University Press (2006), Chapter 13 A Master Formula, p. 250.

Vincenzo Librandi, Table of n, a(n) for n = 0..10000
Eric Weisstein's World of Mathematics, Beta Function.
Index entries for transcendental numbers

Cf. A063448, A247719, A093954, A193887.

RealDigits[Pi/(8*Sqrt[2]), 10, 105] // First

Pi/(8*sqrt(2)) \\ G. C. Greubel, Jul 05 2017

Equals Integral_{x=0..1} (x^2*(1 + x^2))/(1 + x^4)^2 dx.
Equals beta(3/2, 1/2)/(4*sqrt(2)), where 'beta' is Euler's beta function.
Equals Sum_{k >= 0} (-1)^k * (2*k + 1)/((4*k + 1)*(4*k + 3)). - Peter Bala, Sep 21 2016
Equals Integral_{x>=0} 1/(x^2 + 2)^2 dx. - Amiram Eldar, Nov 16 2021

A153799 Decimal expansion of 4 - Pi.

Original entry on oeis.org

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

Offset: 0

Omar E. Pol, Jan 25 2009

Given a square with a side measuring 2 units, having a circle with a radius of 2 units centered on one of its corners, and another circle also with a radius of 2 units centered on the most distant corner from the one on which the first circle is centered, there are two "zones" within the square that overlap with the area of only one of the circles. This number gives the area of either zone. - Alonso del Arte, Aug 01 2012
Area between a circle of radius 1 and the circumscribed square. - Omar E. Pol, Aug 02 2012
Perimeter of the unit square minus the circumference of its incircle. - Jonathan Sondow, Nov 23 2017

			0.8584073464102067615373566167204971158...

G. C. Greubel, Table of n, a(n) for n = 0..2000
Index entries for transcendental numbers

Essentially the same as A030644.

Cf. A000796, A063448.

RealDigits[4 - Pi, 10, 100][[1]] (* Alonso del Arte, Aug 01 2012 *)

PARI
```
4-Pi
```

4 - Pi = (-1)(Pi - 4) = (-1)*Sum_{n >= 1} (4*(-1)^n/(2*n + 1)) = (-1)*arcsin(sin 4). - Alonso del Arte, Aug 01 2012
Equals Integral_{x=0..Pi} cos(x)^2/(1 + sin(x))^2 dx. - Amiram Eldar, Aug 21 2020
Equals Integral_{x=0..4} sqrt(x)/(4+x) dx. - Andy Nicol, Mar 23 2024

A193887 Decimal expansion of Pi * sqrt(2)/8.

Original entry on oeis.org

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

Offset: 0

Alonso del Arte, Aug 07 2011

This number arises as an addend in one way of giving the closed form of sum(k>=0, (-1)^k/(4*k + 1) ), for example, in Spiegel et al. (2009).

			0.55536036726979578088...

Murray R. Spiegel, Seymour Lipschutz, John Liu. Mathematical Handbook of Formulas and Tables, 3rd Ed. Schaum's Outline Series. New York: McGraw-Hill (2009): p. 135, equation 21.17

G. C. Greubel, Table of n, a(n) for n = 0..10000
Piotr Garbaczewski and Vladimir A. Stephanovich, Semigroup modeling of confined Levy flights, arXiv:1106.1530 [cond-mat.stat-mech], 2011, p. 8, equation 40.
Piotr Garbaczewski and Vladimir A. Stephanovich, Dynamics of Confined Lévy Flights in Terms of (Lévy) Semigroups, Acta Phys. Pol. B 43, 977-999 (2012). See p. 992.
Index entries for transcendental numbers.

Cf. A181048, A063448, A247719, A093954, A244976.

R:= RealField(); Pi(R)*Sqrt(2)/8; // G. C. Greubel, Feb 02 2018

RealDigits[(Pi Sqrt[2])/8, 10, 100][[1]]

Pi*sqrt(2)/8 \\ G. C. Greubel, Feb 02 2018

Equals Pi/(4*sqrt(2)).
Equals Sum_{k >= 0} (-1)^k * (4*k + 2)/((4*k + 1)*(4*k + 3)). - Peter Bala, Sep 21 2016
From Amiram Eldar, Aug 15 2020: (Start)
Equals Integral_{x=0..oo} 1/(x^2 + 8) dx.
Equals Integral_{x=0..oo} 1/(8*x^2 + 1) dx.
Equals Integral_{x=0..oo} 1/(1 + x + x^2 + x^3 + x^4 + x^5 + x^6 + x^7) dx. (End)

cp's OEIS Frontend

A105724 Duplicate of A063448.

Views

Author

Keywords

A000290 The squares: a(n) = n^2.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Haskell

Magma

Maple

Mathematica

Maxima

PARI

PARI

Python

Python

Scala

Scheme

Formula

Extensions

A068466 Decimal expansion of Gamma(1/4).

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Magma

Maple

Mathematica

PARI

Formula

A068465 Decimal expansion of Gamma(3/4).

Views

Author

Keywords

Examples

References

Links

Crossrefs

Programs

Magma

Maple

Mathematica

PARI

Formula

A093954 Decimal expansion of Pi/(2*sqrt(2)).

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Formula

A175380 Decimal expansion of Gamma(1/5).

Views

Author

Keywords

Examples

Links

Programs

Magma

Maple