A239566 -id:A239566 - cp's OEIS frontend

A118428 Decimal expansion of heptanacci constant.

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

Offset: 1

Eric W. Weisstein, Apr 27 2006

Other roots of the equation x^7 - x^6 - ... - x - 1 see in A239566. For n>=7, round(c^prime(n)) == 1 (mod 2*prime(n)). Proof in Shevelev link. - Vladimir Shevelev, Mar 21 2014

Note that we have: c + c^(-7) = 2, and the k-nacci constant approaches 2 when k approaches infinity (Martin Gardner). - Bernard Schott, May 07 2022

			1.9919641966050350210...

Martin Gardner, The Second Scientific American Book Of Mathematical Puzzles and Diversions, "Phi: The Golden Ratio", Chapter 8, p. 101, Simon & Schuster, NY, 1961.

S. Litsyn and Vladimir Shevelev, Irrational Factors Satisfying the Little Fermat Theorem, International Journal of Number Theory, vol.1, no.4 (2005), 499-512.
Vladimir Shevelev, A property of n-bonacci constant, Seqfan (Mar 23 2014)
Eric Weisstein's World of Mathematics, Heptanacci Number
Eric Weisstein's World of Mathematics, Heptanacci Constant
Index entries for algebraic numbers, degree 7.

Cf. A066178, A239566.

k-nacci constants: A001622 (Fibonacci), A058265 (tribonacci), A086088 (tetranacci), A103814 (pentanacci), A118427 (hexanacci), this sequence (heptanacci).

RealDigits[x/.FindRoot[x^7+Total[-x^Range[0,6]]==0,{x,2}, WorkingPrecision-> 110]][[1]] (* Harvey P. Dale, Dec 13 2011 *)

polrootsreal(x^7 - x^6 - x^5 - x^4 - x^3 - x^2 - x - 1)[1] \\ Charles R Greathouse IV, Feb 11 2025

A239640 a(n) is the smallest number such that for n-bonacci constant c_n satisfies round(c_n^prime(m)) == 1 (mod 2*p_m) for every m>=a(n).

Original entry on oeis.org

3, 3, 4, 5, 7, 7, 10, 13, 14, 14, 19, 23, 23, 31, 34, 34, 46, 50, 60, 65, 73, 79, 88, 92, 107, 113, 126, 139, 149, 168, 182, 198, 210, 227, 244, 265, 276, 292, 317, 340, 369, 384, 408, 436, 444, 480, 516, 540, 565, 606, 628, 669, 704, 735, 759, 810, 829, 895, 925

Offset: 2

Vladimir Shevelev and Peter J. C. Moses, Mar 23 2014

nonn

The n-bonacci constant is a unique root x_1>1 of the equation x^n-x^(n-1)-...-x-1=0. So, for n=2 we have Fibonacci constant phi or golden ratio (A001622); for n=3 we have tribonacci constant (A058265); for n=4 we have tetranacci constant (A086088), for n=5 (A103814), for n=6 (A118427), etc.

			Let n=2, then c_2 = phi (Fibonacci constant). We have round(c_2^2)=3 is not == 1 (mod 4), round(c_2^3)=4 is not == 1 (mod 6), while round(c_2^5)=11 == 1 (mod 10) and one can prove that for p>=5, we have round(c_2^p) == 1 (mod 2*p). Since 5=prime(3), then a(2)=3.

S. Litsyn and V. Shevelev, Irrational Factors Satisfying the Little Fermat Theorem, International Journal of Number Theory, vol.1, no.4 (2005), 499-512.
V. Shevelev, A property of n-bonacci constant, Seqfan (Mar 23 2014)

Cf. A001622, A007619, A007663, A058265, A086088, A103814, A118427, A118428, A238693, A238697, A238698, A238700, A239502, A239544, A239564, A239565, A239566.

cp's OEIS Frontend

A118428 Decimal expansion of heptanacci constant.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Mathematica

PARI