A160389 -id:A160389 - cp's OEIS frontend

A262770 A Beatty sequence: a(n)=floor(np) where p=2cos(Pi/7)=A160389.

0, 1, 3, 5, 7, 9, 10, 12, 14, 16, 18, 19, 21, 23, 25, 27, 28, 30, 32, 34, 36, 37, 39, 41, 43, 45, 46, 48, 50, 52, 54, 55, 57, 59, 61, 63, 64, 66, 68, 70, 72, 73, 75, 77, 79, 81, 82, 84, 86, 88, 90, 91, 93, 95, 97, 99, 100, 102, 104, 106, 108, 109, 111, 113, 115, 117, 118, 120, 122, 124, 126, 127, 129, 131, 133, 135, 136, 138, 140, 142, 144, 145, 147, 149, 151, 153, 154, 156, 158, 160, 162, 163, 165, 167, 169, 171, 172, 174, 176, 178, 180, 181, 183, 185, 187, 189, 191

Offset: 0

Patrick D McLean, Sep 30 2015

nonn

Beatty sequence of the shorter diagonal (A160389) in a regular heptagon with sidelength 1.
Complement of Beatty sequence A262773 of the longer diagonal (A231187) in a regular heptagon with sidelength 1.
First 106 terms agree with A187318, but A187318(106)=190 while A262770(106)=191.

Peter Steinbach, Golden Fields: A Case for the Heptagon, Mathematics Magazine, Vol. 70, No. 1, Feb. 1997.
Index entries for sequences related to Beatty sequences

Complement of A262773.

Initially agrees with A187318 (because 2*cos(Pi/7) is close to 9/5).

Table[Floor[2 n Cos[Pi/7]], {n, 0, 106}] (* Michael De Vlieger, Oct 05 2015 *)

p=roots([1,-1,-2,1])(1); a(n)=floor(p*n)

a(n) = floor(n*2*cos(Pi/7)); \\ Michel Marcus, Oct 05 2015

A047336 Numbers that are congruent to {1, 6} mod 7.

Original entry on oeis.org

1, 6, 8, 13, 15, 20, 22, 27, 29, 34, 36, 41, 43, 48, 50, 55, 57, 62, 64, 69, 71, 76, 78, 83, 85, 90, 92, 97, 99, 104, 106, 111, 113, 118, 120, 125, 127, 132, 134, 139, 141, 146, 148, 153, 155, 160, 162, 167, 169, 174, 176, 181, 183, 188, 190, 195, 197, 202, 204, 209

Offset: 1

N. J. A. Sloane

Cf. property described by Gary Detlefs in A113801: more generally, these numbers are of the form (2*h*n+(h-4)*(-1)^n-h)/4 (h, n natural numbers), therefore ((2*h*n+(h-4)*(-1)^n-h)/4)^2-1 == 0 (mod h); in this case, a(n)^2-1 == 0 (mod 7). - Bruno Berselli, Nov 17 2010

Reinhard Zumkeller, Table of n, a(n) for n = 1..10000
Index entries for linear recurrences with constant coefficients, signature (1,1,-1).

Cf. A007310, A019674, A047522, A045472 (primes), A195041 (partial sums), A005408, A047209, A056020, A090771, A091998, A113801, A160389, A175885, A175886, A175887, A178818, A371858.

a047336 n = a047336_list !! (n-1)
a047336_list = 1 : 6 : map (+ 7) a047336_list
-- Reinhard Zumkeller, Jan 07 2012

[n: n in [1..210]| n mod 7 in {1,6}]; // Bruno Berselli, Feb 22 2011

Rest[Flatten[Table[{7i-1,7i+1},{i,0,40}]]] (* Harvey P. Dale, Nov 20 2010 *)

a(n)=n\2*7-(-1)^n \\ Charles R Greathouse IV, May 02 2016

a(1) = 1; a(n) = 7(n-1) - a(n-1). - Rolf Pleisch, Jan 31 2008 (corrected by Jon E. Schoenfield, Dec 22 2008)
a(n) = (7/2)*(n-(1-(-1)^n)/2) - (-1)^n. - Rolf Pleisch, Nov 02 2010
From Bruno Berselli, Nov 17 2010: (Start)
G.f.: x*(1+5*x+x^2)/((1+x)*(1-x)^2).
a(n) = -a(-n+1) = a(n-1) + a(n-2) - a(n-3).
a(n) = a(n-2)+7.
a(n) = 7*A000217(n-1)+1 - 2*Sum_{i=1..n-1} a(i) for n > 1. (End)
a(n) = 7*floor(n/2)+(-1)^(n+1). - Gary Detlefs, Dec 29 2011
Sum_{n>=1} (-1)^(n+1)/a(n) = (Pi/7)*cot(Pi/7) = A019674 * A178818. - Amiram Eldar, Dec 04 2021
E.g.f.: 1 + ((14*x - 7)*exp(x) + 3*exp(-x))/4. - David Lovler, Sep 01 2022
From Amiram Eldar, Nov 22 2024: (Start)
Product_{n>=1} (1 - (-1)^n/a(n)) = 2*cos(Pi/7) (A160389).
Product_{n>=2} (1 + (-1)^n/a(n)) = (Pi/7) * cosec(Pi/7) (A371858). (End)

More terms from Jon E. Schoenfield, Jan 18 2009

A255249 Decimal expansion of -2cos(5Pi/7).

Original entry on oeis.org

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

Offset: 1

Wolfdieter Lang, Mar 13 2015

rho_3 := +2*cos(5*Pi/7) is the negative zero of the minimal polynomial C(7, x) = x^3 - x^2 - 2*x + 1 of the algebraic number rho(7) = 2*cos(Pi/7), the length ratio of the smaller diagonal and the side in the regular 7-gon (heptagon). See A187360 and a link to the arXiv paper given there, eq. (20) for the zeros of C(n, x). The positive zeros are rho(7) and rho_2 = 2*cos(3*Pi/7) shown in A160389 and A255241.

Essentially the same as A231187 and A116425. - R. J. Mathar, Mar 14 2015

			1.2469796037174670610500097680084796212645494617928042107310988781937073049...

John H. Conway and Richard K. Guy, The Book of Numbers, New York: Springer-Verlag, 1996. See p. 207.

Wikipedia, Gaussian period.
Index entries for algebraic numbers, degree 3

Cf. A047385, A160389, A187360, A255241, A330002, A330003 (Beatty sequences), A362922.

r = x /. FindRoot[1/x + 1/(x+1)^2 == 1, {x, 2, 10}, WorkingPrecision -> 210]
RealDigits[r][[1]]
Plot[1/x + 1/(x+1)^2, {x, 1, 2}] (* Clark Kimberling, Jan 04 2020 *)

polrootsreal(x^3 + x^2 - 2*x - 1)[3] \\ Charles R Greathouse IV, Oct 30 2023

2*cos(5*Pi/7) = - 2*sin(3*Pi/14) = -1.246979603...
Solution of x^3 + x^2 - 2 x - 1 = 0; +1.246979603...  - Clark Kimberling, Jan 04 2020
Equals i^(4/7) - i^(10/7). - Peter Luschny, Apr 04 2020
From Peter Bala, Oct 20 2021: (Start)
Equals z + z^6, where z = exp(2*Pi*i/7), so this constant is one of the three cubic Gaussian periods for the modulus 7. The other periods are - A255241 and - A160389.
Equals (1 - z^2)*(1 - z^5)/((1 - z)*(1 - z^6)) - 2.
Equals Product_{n >= 0} (7*n+3)*(7*n+4)/((7*n+2)*(7*n+5)) = A231187 - 1. (End)
Equals Product_{k>=1} (1 - (-1)^k/A047385(k)). - Amiram Eldar, Nov 22 2024
Equals 1/(A160389-1) = 2*A362922. - Hugo Pfoertner, Nov 22 2024

A255241 Decimal expansion of 2cos(3Pi/7).

Original entry on oeis.org

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

Offset: 0

Wolfdieter Lang, Mar 13 2015

This is also the decimal expansion of 2*sin(Pi/14).
rho_2 := 2*cos(3*Pi/7) and rho(7) := 2*cos(Pi/7) (see A160389) are the two positive zeros of the minimal polynomial C(7, x) = x^3 - x^2 - 2*x + 1 of the algebraic number rho(7), the length ratio of the smaller diagonal and the side in the regular 7-gon (heptagon). See A187360 and a link to the arXiv paper given there, eq. (20) for the zeros of C(n, x). The other zero is negative, rho_3 := 2*cos(5*Pi/n). See -A255249.
Also the edge length of a regular 14-gon with unit circumradius. Such an m-gon is not constructible using a compass and a straightedge (see A004169). With an even m, in fact, it would be constructible only if the (m/2)-gon were constructible, which is not true in this case (see A272487). - Stanislav Sykora, May 01 2016

			0.445041867912628808577805128993589518932711137529089910623974031...

John H. Conway and Richard K. Guy, The Book of Numbers, New York: Springer-Verlag, 1996. See p. 207.

Stanislav Sykora, Table of n, a(n) for n = 0..2000
Wikipedia, Constructible number
Wikipedia, Regular polygon
Index entries for algebraic numbers, degree 3

Cf. A004169, A160389, A187360, A255249, A232736, A255240.

Edge lengths of other nonconstructible n-gons: A272487 (n=7), A272488 (n=9), A272489 (n=11), A130880 (n=18), A272491 (n=19). - Stanislav Sykora, May 01 2016

R:= RealField(120); 2*Cos(3*Pi(R)/7); // G. C. Greubel, Sep 04 2022

RealDigits[N[2Cos[3Pi/7], 100]][[1]] (* Robert Price, May 01 2016 *)

PARI
```
2*sin(Pi/14)
```

polrootsreal(x^3 - x^2 - 2*x + 1)[2] \\ Charles R Greathouse IV, Oct 30 2023

numerical_approx(2*cos(3*pi/7), digits=120) # G. C. Greubel, Sep 04 2022

2*cos(3*Pi/7) = 2*sin(Pi/14) = 2*A232736 = 1/A231187 = 0.4450418679...
See A232736 for the decimal expansion of cos(3*Pi/7) = sin(Pi/14).
Equals i^(6/7) - i^(8/7). - Peter Luschny, Apr 04 2020
From Peter Bala, Oct 11 2021: (Start)
Equals 2 - (1 - z^3)*(1 - z^4)/((1 - z^2)*(1 - z^5)), where z = exp(2*Pi*i/7).
Equals 1 - A255240. (End)

Offset corrected by Stanislav Sykora, May 01 2016

A005021 Random walks (binomial transform of A006054).

Original entry on oeis.org

1, 5, 19, 66, 221, 728, 2380, 7753, 25213, 81927, 266110, 864201, 2806272, 9112264, 29587889, 96072133, 311945595, 1012883066, 3288813893, 10678716664, 34673583028, 112584429049, 365559363741, 1186963827439, 3854047383798, 12514013318097, 40632746115136

Offset: 0

N. J. A. Sloane

Number of walks of length 2n+5 in the path graph P_6 from one end to the other one. Example: a(1)=5 because in the path ABCDEF we have ABABCDEF, ABCBCDEF, ABCDCDEF, ABCDEDEF and ABCDEFEF. - Emeric Deutsch, Apr 02 2004
Since a(n) is the binomial transform of A006054 from formula (3.63) in the Witula-Slota-Warzynski paper, it follows that a(n)=A(n;1)*(B(n;-1)-C(n;-1))-B(n;1)*B(n;-1)+C(n;1)*(A(n;-1)-B(n;-1)+C(n;-1)), where A(n;1)=A077998(n), B(n;1)=A006054(n+1), C(n;1)=A006054(n), A(n;-1)=A121449(n), B(n+1;-1)=-A085810(n+1), C(n;-1)=A215404(n) and A(n;d), B(n;d), C(n;d), n in N, d in C, denote the quasi-Fibonacci numbers defined and discussed in comments in A121449 and in the cited paper. - Roman Witula, Aug 09 2012
From Wolfdieter Lang, Mar 30 2020: (Start)
With offset -4 this sequence 6, 1, 0, 0, 1, 5, ... appears in the formula for the n-th power of the 3 X 3 tridiagonal Matrix M_3 = Matrix([1,1,0], [1,2,1], [0,1,2]) from A332602: (M_3)^n = a(n-2)*(M_3)^2 - (6*a(n-3) - a(n-4))*M_3 + a(n-3)*1_3, with the 3 X 3 unit matrix 1_3, for n >= 0. Proof from Cayley-Hamilton: (M_3)^n = 5*(M_3)^3 - 6*M_3 + 1_3 (see A332602 for the characteristic polynomial Phi(3, x)), and the recurrence (M_3)^n = M_3*(M_3)^(n-1). For (M_3)^n[1,1] = 2*a(n-2) - 5*a(n-3) + a(n-4), for n >= 0, see A080937(n).
The formula for a(n) in terms of r = rho(7) = A160389 given below shows that a(n)/a(n-1) converges to rho(7)^2 = A116425 = 3.2469796... for n -> infinity. This is because r - 2/r = 0.692..., and r - 1 - 1/r = 0.137... .
(End)

W. Feller, An Introduction to Probability Theory and its Applications, 3rd ed, Wiley, New York, 1968, p. 96.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

G. C. Greubel, Table of n, a(n) for n = 0..1000
Andrei Asinowski and Michaela A. Polley, Patterns in rectangulations. Part I: T-like patterns, inversion sequence classes I(010, 101, 120, 201) and I(011, 201), and rushed Dyck paths, arXiv:2501.11781 [math.CO], 2025. See p. 26.
Jean-Luc Baril and Helmut Prodinger, Enumeration of partial Lukasiewicz paths, arXiv:2205.01383 [math.CO], 2022.
Paul Barry, Centered polygon numbers, heptagons and nonagons, and the Robbins numbers, arXiv:2104.01644 [math.CO], 2021.
Nachum Dershowitz, Between Broadway and the Hudson: A Bijection of Corridor Paths, arXiv:2006.06516 [math.CO], 2020.
C. J. Everett and P. R. Stein, The combinatorics of random walk with absorbing barriers, Discrete Math. 17 (1977), no. 1, 27-45.
C. J. Everett and P. R. Stein, The combinatorics of random walk with absorbing barriers, Discrete Math. 17 (1977), no. 1, 27-45. [Annotated scanned copy]
G. Kreweras, Sur les éventails de segments, Cahiers du Bureau Universitaire de Recherche Opérationnelle, Institut de Statistique, Université de Paris, #15 (1970), 3-41. [Annotated scanned copy]
S. Morier-Genoud, V. Ovsienko and S. Tabachnikov, 2-frieze patterns and the cluster structure of the space of polygons, Annales de l'institut Fourier, 62 no. 3 (2012), 937-987; arXiv:1008.3359 [math.AG], 2010-2011. - From _N. J. A. Sloane_, Dec 26 2012
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
N. J. A. Sloane, Transforms
László Németh and László Szalay, Sequences Involving Square Zig-Zag Shapes, J. Int. Seq., Vol. 24 (2021), Article 21.5.2.
Roman Witula, Damian Slota and Adam Warzynski, Quasi-Fibonacci Numbers of the Seventh Order, J. Integer Seq., 9 (2006), Article 06.4.3.
Index entries for linear recurrences with constant coefficients, signature (5,-6,1).

Double partial sums of A060557. Bisection of A052547.

Cf. A094789, A094790, A080937, A160389, A116425, A322602.

I:=[1,5,19]; [n le 3 select I[n] else 5*Self(n-1)-6*Self(n-2)+Self(n-3): n in [1..30]]; // Vincenzo Librandi, Sep 18 2015

a:=k->sum(binomial(5+2*k,7*j+k-2),j=ceil((2-k)/7)..floor((7+k)/7))-sum(binomial(5+2*k,7*j+k-1),j=ceil((1-k)/7)..floor((6+k)/7)): seq(a(k),k=0..25);
A005021:=-(z-1)*(z-5)/(-1+5*z-6*z**2+z**3); # conjectured by Simon Plouffe in his 1992 dissertation; gives sequence apart from the initial 1

LinearRecurrence[{5,-6,1}, {1,5,19}, 50] (* Roman Witula, Aug 09 2012 *)
CoefficientList[Series[1/(1 - 5 x + 6 x^2 - x^3), {x, 0, 40}], x] (* Vincenzo Librandi, Sep 18 2015 *)

x='x+O('x^30); Vec(1/(1-5*x+6*x^2-x^3)) \\ G. C. Greubel, Apr 19 2018

G.f.: 1/(1-5x+6x^2-x^3). - Emeric Deutsch, Apr 02 2004
a(n) = 5*a(n-1) -6*a(n-2) +a(n-3). - Emeric Deutsch, Apr 02 2004
a(n) = Sum_{j=-infinity..infinity} (binomial(5+2*k, 7*j+k-2) - binomial(5+2*k, 7*j+k-1)) (a finite sum).
a(n-2) = 2^n*C(n;1/2)=(1/7)*((c(2)-c(4))*(c(4))^(2n) + (c(4)-c(1))*(c(1))^(2n) + (c(1)-c(2))*(c(2))^(2n)), where a(-2)=a(-1):=0, c(j):=2*cos(2Pi*j/7). This formula follows from the Binet formula for C(n;d)--one of the quasi-Fibonacci numbers (see comments in A121449 and the formula (3.17) in the Witula-Slota-Warzynski paper). - Roman Witula, Aug 09 2012
In terms of the algebraic number r = rho(7) = 2*cos(Pi/7) = A160389 of degree 3 the preceding formula gives a(n) = r^(2*(n+2))*(A1(r) + A2(r)*(r - 2/r)^(2*(n+1)) = A3(r)*(r - 1 - 1/r)^(2*(n+1)))/7, for n >= -4 (see a comment above for this offset), with A1(r) = -r^2 + 2*r + 1, A2(r) = -r^2 - r + 2, and A3(r) = 2*r^2 - r - 3. - Wolfdieter Lang, Mar 30 2020

a(25)-a(26) from Vincenzo Librandi, Sep 18 2015

A080937 Number of Catalan paths (nonnegative, starting and ending at 0, step +/-1) of 2*n steps with all values <= 5.

Original entry on oeis.org

1, 1, 2, 5, 14, 42, 131, 417, 1341, 4334, 14041, 45542, 147798, 479779, 1557649, 5057369, 16420730, 53317085, 173118414, 562110290, 1825158051, 5926246929, 19242396629, 62479659622, 202870165265, 658715265222, 2138834994142, 6944753544643, 22549473023585

Offset: 0

Henry Bottomley, Feb 25 2003

With interpolated zeros (1,0,1,0,2,...), counts closed walks of length n at start or end node of P_6. The sequence (0,1,0,2,...) counts walks of length n between the start and second node. - Paul Barry, Jan 26 2005
HANKEL transform of sequence and the sequence omitting a(0) is the sequence A130716. This is the unique sequence with that property. - Michael Somos, May 04 2012
From Wolfdieter Lang, Mar 30 2020: (Start)
a(n) is also the upper left entry of the n-th power of the 3 X 3 tridiagonal matrix M_3 = Matrix([1,1,0], [1,2,1], [0,1,2]) from A332602: a(n) = ((M_3)^n)[1,1].
Proof: (M_3)^n = b(n-2)*(M_3)^2 - (6*b(n-3) - b(n-4))*M_3 + b(n-3)*1_3, for n >= 0, with b(n) = A005021(n), for n >= -4. For the proof of this see a comment in A005021. Hence (M_3)^n[1,1] = 2*b(n-2) - 5*b(n-3) + b(n-4), for n >= 0. This proves the 3 X 3 part of the conjecture in A332602 by Gary W. Adamson.
The formula for a(n) given below in terms of r = rho(7) = A160389 proves that a(n)/a(n-1) converges to rho(7)^2 = A116425 = 3.2469796..., because r - 2/r = 0.6920... < 1, and r^2 - 3 = 0.2469... < 1. This limit was conjectured in A332602 by Gary W. Adamson.
(End)

			G.f. = 1 + x + 2*x^2 + 5*x^3 + 14*x^4 + 42*x^5 + 131*x^6 + 417*x^7 + 1341*x^8 + ...

Alois P. Heinz, Table of n, a(n) for n = 0..600
Jean Luc Baril, Rigoberto Flórez, and José L. Ramirez, Generalized Narayana arrays, restricted Dyck paths, and related bijections, Univ. Bourgogne (France, 2025). See p. 27.
Jean-Luc Baril, Toufik Mansour, José L. Ramírez, and Mark Shattuck, Catalan words avoiding a pattern of length four, Univ. de Bourgogne (France, 2024). See p. 3.
Jean-Luc Baril and Helmut Prodinger, Enumeration of partial Lukasiewicz paths, arXiv:2205.01383 [math.CO], 2022.
Paul Barry, Centered polygon numbers, heptagons and nonagons, and the Robbins numbers, arXiv:2104.01644 [math.CO], 2021.
Giulio Cerbai, Anders Claesson, and Luca Ferrari, Stack sorting with restricted stacks, arXiv:1907.08142 [cs.DS], 2019.
Wei Chen, Enumeration of Set Partitions Refined by Crossing and Nesting Numbers, MS Thesis, Department of Mathematics. Simon Fraser University, Fall 2014. Table 4.1, line k=2.
Johann Cigler, Number of bounded Dyck paths with "negative length", MathOverflow question, Sep 26 2020.
Michael Dairyko, Lara Pudwell, Samantha Tyner, and Casey Wynn, Non-contiguous pattern avoidance in binary trees, Electron. J. Combin. 19 (2012), no. 3, Paper 22, 21 pp. MR2967227.
Nachum Dershowitz, Between Broadway and the Hudson: A Bijection of Corridor Paths, arXiv:2006.06516 [math.CO], 2020.
Paul Duncan and Einar Steingrimsson, Pattern avoidance in ascent sequences, arXiv preprint arXiv:1109.3641 [math.CO], 2011.
Sergi Elizalde, Symmetric peaks and symmetric valleys in Dyck paths, arXiv:2008.05669 [math.CO], 2020.
Stefan Felsner and Daniel Heldt, Lattice Path Enumeration and Toeplitz Matrices, J. Int. Seq. 18 (2015) # 15.1.3.
Daniel Heldt, On the mixing time of the face flip-and up/down Markov chain for some families of graphs, Dissertation, Mathematik und Naturwissenschaften der Technischen Universitat Berlin zur Erlangung des akademischen Grades Doktor der Naturwissenschaften, 2016.
Matthew Hyatt and Jeffrey Remmel, The classification of 231-avoiding permutations by descents and maximum drop, arXiv preprint arXiv:1208.1052 [math.CO], 2012. - From _N. J. A. Sloane_, Dec 24 2012
Aleksandar Ilic and Andreja Ilic, On the number of restricted Dyck paths, Filomat 25:3 (2011), 191-201; DOI: 10.2298/FIL1103191I.
Sergey Kitaev, Jeffrey Remmel and Mark Tiefenbruck, Marked mesh patterns in 132-avoiding permutations I, arXiv:1201.6243v1 [math.CO], 2012 (Corollary 3, case k=5, pages 10-11). - From _N. J. A. Sloane_, May 09 2012
Erkko Lehtonen and Tamás Waldhauser, Associative spectra of graph algebras I. Foundations, undirected graphs, antiassociative graphs, arXiv:2011.07621 [math.CO], 2020. See also J. of Algebraic Combinatorics (2021) Vol. 53, 613-638.
Toufik Mansour and Mark Shattuck, Some enumerative results related to ascent sequences, arXiv preprint arXiv:1207.3755 [math.CO], 2012. - From _N. J. A. Sloane_, Dec 22 2012
Sophie Morier-Genoud, Valentin Ovsienko, and Serge Tabachnikov, 2-frieze patterns and the cluster structure of the space of polygons, arXiv:1008.3359 [math.AG], 2010-2011. - From _N. J. A. Sloane_, Dec 26 2012
Sophie Morier-Genoud, Valentin Ovsienko, and Serge Tabachnikov, 2-frieze patterns and the cluster structure of the space of polygons, Annales de l'institut Fourier, 62 no. 3 (2012), 937-987. - From _N. J. A. Sloane_, Dec 26 2012
David Nečas and Ivan Ohlídal, Consolidated series for efficient calculation of the reflection and transmission in rough multilayers, Optics Express, Vol. 22, 2014, No. 4; DOI:10.1364/OE.22.004499.
László Németh and László Szalay, Sequences Involving Square Zig-Zag Shapes, J. Int. Seq., Vol. 24 (2021), Article 21.5.2.
Lara Pudwell, Pattern avoidance in trees, slides from a talk, mentions many sequences, 2012. - From _N. J. A. Sloane_, Jan 03 2013
Lara Pudwell and Andrew Baxter, Ascent sequences avoiding pairs of patterns, 2014.
Santiago Rojas-Rojas, Camila Muñoz, Edgar Barriga, Pablo Solano, Aldo Delgado, and Carla Hermann-Avigliano, Analytic Evolution for Complex Coupled Tight-Binding Models: Applications to Quantum Light Manipulation, arXiv:2310.12366 [quant-ph], 2023. See p. 12.
Index entries for linear recurrences with constant coefficients, signature (5,-6,1).

Cf. A000007, A000012, A001519, A007051, A011782, A024175, A080937, A080938.
Cf. A033191 which essentially provide the same sequence for different limits and tend to A000108.
Cf. A005021, A094790, A094789.
Cf. A211216, A005021, A160389, A116425, A332602.

I:=[1,1,2]; [n le 3 select I[n] else 5*Self(n-1)-6*Self(n-2)+Self(n-3): n in [1..30]]; // Vincenzo Librandi, Jan 09 2016

a:= n-> (<<0|1|0>, <0|0|1>, <1|-6|5>>^n. <<1, 1, 2>>)[1, 1]:
seq(a(n), n=0..35);  # Alois P. Heinz, Nov 09 2012

nn=56;Select[CoefficientList[Series[(1-4x^2+3x^4)/(1-5x^2+6x^4-x^6), {x,0,nn}], x],#>0 &] (* Geoffrey Critzer, Jan 26 2014 *)
LinearRecurrence[{5,-6,1},{1,1,2},30] (* Jean-François Alcover, Jan 09 2016 *)

a=vector(99); a[1]=1; a[2]=2;a[3]=5; for(n=4,#a,a[n]=5*a[n-1]-6*a[n-2] +a[n-3]); a \\ Charles R Greathouse IV, Jun 10 2011

{a(n) = if( n<0, n = -n; polcoeff( (1 - 3*x + x^2) / (1 - 6*x + 5*x^2 - x^3) + x * O(x^n), n), polcoeff( (1 - 4*x + 3*x^2) / (1 - 5*x + 6*x^2 - x^3) + x * O(x^n), n))} /* Michael Somos, May 04 2012 */

a(n) = A080934(n,5).
G.f.: (1-4*x+3*x^2)/(1-5*x+6*x^2-x^3). - Ralf Stephan, May 13 2003
a(n) = 5*a(n-1) - 6*a(n-2) + a(n-3). - Herbert Kociemba, Jun 11 2004
a(n) = A096976(2*n). - Floor van Lamoen, Nov 02 2005
a(n) = (4/7-4/7*cos(1/7*Pi)^2)*(4*(cos(Pi/7))^2)^n + (1/7-2/7*cos(1/7*Pi) + 4/7*cos(1/7*Pi)^2)*(4*(cos(2*Pi/7))^2)^n + (2/7+2/7*cos(1/7*Pi))*(4*(cos(3*Pi/7))^2)^n for n>=0. - Richard Choulet, Apr 19 2010
G.f.: 1 / (1 - x / (1 - x / (1 - x / (1 - x / (1 - x))))). - Michael Somos, May 04 2012
a(-n) = A038213(n). a(n + 2) * a(n) - a(n + 1)^2 = a(1 - n). Convolution inverse is A123183 with A123183(0)=1. - Michael Somos, May 04 2012
From Wolfdieter Lang, Mar 30 2020: (Start)
In terms of the algebraic number r = rho(7) = A160389 of degree 3 the formula given by Richard Choulet becomes a(n) = (1/7)*(r)^(2*n)*(C1(r) + C2(r)*(r - 2/r)^(2*n) + C3(r)*(r^2 - 3)^(2*n)), with C1(r) = 4 - r^2, C2(r) = 1 - r + r^2, and C3 = 2 + r.
a(n) = ((M_3)^n)[1,1] = 2*b(n-2) - 5*b(n-3) + b(n-4), for n >= 0, with the 3 X 3 tridiagonal matrix M_3 = Matrix([1,1,0], [1,2,1], [0,1,2]) from A332602, and b(n) = A005021(n) (with offset n >= -4). (End)

A220086 Decimal expansion of Gamma(1/7).

Original entry on oeis.org

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

Offset: 1

Bruno Berselli, Dec 12 2012

(A220086/A220605)*(A220607/A220606) = A160389, which is the case n=7 of (Gamma(1/n)/Gamma(2/n))*(Gamma((n-1)/n)/Gamma((n-2)/n)) = 2*cos(Pi/n).
A220086*A220605*A220606*A220607*A220608*A220609 = (2*Pi)^3/sqrt(7), which is the case n=7 of product(Gamma(i/n), i=1..n-1) = sqrt((2*Pi)^(n-1)/n) (see also the second link to Wikipedia).
Continued fraction expansion: 6, 1, 1, 4, 1, 2, 2, 1, 5, 1, 10, 7, 1,...

			6.5480629402478244377140933494289962626211351873841351...

Vincenzo Librandi, Table of n, a(n) for n = 1..1000
Wikipedia, Particular values of the Gamma function: General rational arguments
Wikipedia, Particular values of the Gamma function: Products
Index to sequences related to the Gamma function

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

Mathematica
```
RealDigits[Gamma[1/7], 10, 90][[1]]
```
Maxima
```
fpprec:90; ev(bfloat(gamma(1/7)));
```

default(realprecision, 100); gamma(1/7) \\ G. C. Greubel, Mar 10 2018

Equals Pi * csc(Pi/7) / A220607, where csc is the cosecant function.
(A220086/A220605) * (A220607/A220606) = A160389, which is the case n=7 of (Gamma(1/n)/Gamma(2/n))*(Gamma((n-1)/n)/Gamma((n-2)/n)) = 2*cos(Pi/n).
A220086*A220605*A220606*A220607*A220608*A220609 = (2*Pi)^3/sqrt(7), which is the case n=7 of product(Gamma(i/n), i=1..n-1) = sqrt((2*Pi)^(n-1)/n) (see also the second link to Wikipedia).
A220086*A220607 = A220605*A220606 + A220608*A220609. - Andrea Pinos, May 21 2025

A255240 Decimal expansion of 1/(2*cos(Pi/7)).

Original entry on oeis.org

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

Offset: 0

Wolfdieter Lang, Mar 12 2015

This is the decimal expansion of t = 1/rho(7) = 2 + rho(7) - rho(7)^2 with rho(7) = 2*cos(Pi/7) the length ratio of the smaller diagonal and the side of a regular heptagon. See A160389 for the decimal expansion of rho(7).
t satisfies the cubic equation t^3 - 2*t^2 - t + 1 = 0.
t = 1/rho(7) is the slope tan(alpha) appearing in Archimedes's neusis construction of the regular heptagon. The corresponding angle alpha is approximately 29,028 degrees. See the link, Figure 1, also for references.
From Peter Bala, Oct 16 2021: (Start)
t = sin(Pi/7)/sin(2*Pi/7). The other roots of the cubic equation t^3 - 2*t^2 - t + 1 = 0 are t_1 = 1/(1 - t) = sin(3*Pi/7)/sin(6*Pi/7) = 2.2469796037... and t_2 = 1/(1 - t_1) = - sin(2*Pi/7)/sin(4*Pi/7) = - 0.8019377358.... Compare with A231187 and A160389.
The algebraic number field Q(t) is a totally real cubic field of discriminant 7^2 and class number 1 with a cyclic Galois group over Q of order 3.  See Shanks. (End)

			0.5549581320873711914221948710064104810672888624709100893760259682051575359...

Wolfdieter Lang, Archimedes's Construction of the Regular Heptagon.
Daniel Shanks, The simplest cubic fields, Math. Comp., 28 (1974), 1137-1152.
Index entries for algebraic numbers, degree 3.

Cf. A047385, A116425, A160389, A231187, A255241.

RealDigits[1/(2*Cos[Pi/7]), 10, 100][[1]] (* Georg Fischer, Apr 04 2020 *)

1/rho(7) = 1/(2*cos(Pi/7)) = 0.55495813208...
From Peter Bala, Oct 10 2021: (Start)
t = 2*(cos(Pi/7) - cos(2*Pi/7)); t_1 = 2*(cos(3*Pi/7) - cos(6*Pi/7)); t_2 = 2*(cos(5*Pi/7) - cos(10*Pi/7)).
t = Product_{n >= 0} (7*n+1)*(7*n+6)/((7*n+2)*(7*n+5)) = 1 - Product_{n >= 0} (7*n+1)*(7*n+6)/((7*n+3)*(7*n+4)) =  1 - A255241. (End)
Equals Product_{k>=1} (1 + (-1)^k/A047385(k)). - Amiram Eldar, Nov 22 2024

Name corrected by Georg Fischer, Apr 04 2020

A116425 Decimal expansion of 2 + 2cos(2Pi/7).

Original entry on oeis.org

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

Offset: 1

Eric W. Weisstein, Feb 15 2006

A root of the equation x^3 - 5*x^2 + 6*x - 1 = 0. - Arkadiusz Wesolowski, Jan 13 2016

The other two roots of this minimal polynomial of the present algebraic number (rho(7))^2, with rho(7) = 2*cos(Pi/7) = A160389 are (2*cos(3*Pi/7))^2 = (A255241)^2 and (2*cos(5*Pi/7))^2 = (-A255249)^2. - Wolfdieter Lang, Mar 30 2020

			3.246979603717467061...

Steven R. Finch, Mathematical Constants, Cambridge University Press, 2003, Section 5.25 Tutte-Beraha Constants, p. 417.

Jesús Salas and Alan D. Sokal, Transfer matrices and partition functions zeros for antiferromagnetic Potts models, arXiv:cond-mat/0004330 [cond-mat.stat-mech], 2000-2001, p. 64.
Eric Weisstein's World of Mathematics, Logistic Map
Eric Weisstein's World of Mathematics, Silver Constant
Index entries for algebraic numbers, degree 3

Cf. A231187, A160389.
Cf. A003558, A054142, A255241, A255249.
2 + 2*cos(2*Pi/n): A104457 (n = 5), A332438 (n = 9), A296184 (n = 10), A019973 (n = 12).

First@ RealDigits[N[2 + 2 Cos[2 Pi/7], 120]] (* Michael De Vlieger, Jan 13 2016 *)

2 + 2*cos(2*Pi/7) \\ Michel Marcus, Jan 13 2016

Equals (2*cos(Pi/7))^2 = (A160389)^2.
Equals 2 + i^(4/7) - i^(10/7). - Peter Luschny, Apr 04 2020
Let  c = 2 + 2*cos(2*Pi/7). The linear fractional transformation z -> c - c/z has order 7, that is, z = c - c/(c - c/(c - c/(c - c/(c - c/(c - c/(c - c/z)))))). - Peter Bala, May 09 2024

A272487 Decimal expansion of the edge length of a regular heptagon with unit circumradius.

Original entry on oeis.org

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

Offset: 0

Stanislav Sykora, May 01 2016

The edge length e(m) of a regular m-gon is e(m) = 2*sin(Pi/m). In this case, m = 7, and the constant, a = e(7), is the smallest m for which e(m) is not constructible using a compass and a straightedge (see A004169). With an odd m, in fact, e(m) would be constructible only if m were a Fermat prime (A019434).

			0.8677674782351162409515366656967175092199814555749197528890946...

Stanislav Sykora, Table of n, a(n) for n = 0..2000
Wikipedia, Constructible number
Wikipedia, Heptagon
Wikipedia, Regular polygon
Index entries for algebraic numbers, degree 6

Cf. A004169, A019434.
Cf. A160389.
Edge lengths of nonconstructible n-gons: A272488 (n=9), A272489 (n=11), A272490 (n=13), A255241 (n=14), A130880 (n=18), A272491 (n=19).

N[2*Sin[Pi/7], 25] (* G. C. Greubel, May 01 2016 *)
RealDigits[2*Sin[Pi/7],10,120][[1]] (* Harvey P. Dale, Mar 07 2020 *)

PARI
```
2*sin(Pi/7)
```

Equals 2*sin(Pi/7) = 2*cos(Pi*5/14).
Equals i^(-5/7) + i^(5/7). - Gary W. Adamson, Feb 12 2022
One of the 6 real-valued roots of x^6 -7*x^4 +14*x^2 -7 =0. - R. J. Mathar, Aug 29 2025

cp's OEIS Frontend

A262770 A Beatty sequence: a(n)=floor(n*p) where p=2*cos(Pi/7)=A160389.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

Octave

PARI

A047336 Numbers that are congruent to {1, 6} mod 7.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Haskell

Magma

Mathematica

PARI

Formula

Extensions

A255249 Decimal expansion of -2*cos(5*Pi/7).

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A255241 Decimal expansion of 2*cos(3*Pi/7).

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Magma

Mathematica

PARI

PARI

SageMath

Formula

Extensions

A005021 Random walks (binomial transform of A006054).

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Magma

Maple

Mathematica

PARI

Formula

Extensions

A080937 Number of Catalan paths (nonnegative, starting and ending at 0, step +/-1) of 2*n steps with all values <= 5.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

A262770 A Beatty sequence: a(n)=floor(np) where p=2cos(Pi/7)=A160389.

A255249 Decimal expansion of -2cos(5Pi/7).

A255241 Decimal expansion of 2cos(3Pi/7).

A116425 Decimal expansion of 2 + 2cos(2Pi/7).