OFFSET
0,1
COMMENTS
LINKS
Paolo Xausa, Table of n, a(n) for n = 0..10000
Hans-Georg Carstens, Walter A. Deuber, Wolfgang Thumser, and Elke Koppenrade, Geometrical Bijections in Discrete Lattices. Combinatorics, Probability and Computing, 8(1-2), 109-129, 1999.
Jan Fricke, Symmetric Graphs have symmetric Matchings, arXiv:1607.07426 [math.GR], 25 Jul 2016, Introduction.
Klaus Nagel, A Lower Bound for Double Lattice Bijections, August 17, 2025.
FORMULA
The minimal polynomial is 8*x^4 - 40*x^2 + 25. - Joerg Arndt, Aug 02 2025
EXAMPLE
0.8557061686312838477748180718246837073...
MATHEMATICA
First[RealDigits[Sqrt[5]*Sin[Pi/8], 10, 100]] (* Paolo Xausa, Aug 13 2025 *)
PROG
(PARI) sqrt(5)*sin(Pi/8) \\ Charles R Greathouse IV, Aug 19 2025
CROSSREFS
KEYWORD
nonn,cons
AUTHOR
Hugo Pfoertner, Jul 18 2025
STATUS
approved
