3-step Fibonacci sequences in nilpotent groups.

DOI10.1016/S0096-3003(02)00427-7zbMath1073.11504MaRDI QIDQ1405080

Engin Özkan

Publication date: 25 August 2003

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

zbMATH Keywords

Fibonacci sequencesNilpotency classNilpotent group

Mathematics Subject Classification ID

Nilpotent groups (20F18) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)

Related Items (7)

The cyclic sequences in non-Abelian groups ⋮ The Tribonacci-type balancing numbers and their applications ⋮ Hyperbolic functions obtained from \(k\)-Pell sequences ⋮ Unnamed Item ⋮ On the new Narayana polynomials, the Gauss Narayana numbers and their polynomials ⋮ On a new family of gauss k-Lucas numbers and their polynomials ⋮ Hyperbolic functions obtained from k-Jacobsthal sequences

Cites Work

• A fast algorithm for computing large Fibonacci numbers
• An application of Fibonacci sequences in groups
• Generating trees and forbidden subsequences
• Fibonacci Series Modulo m
• Finite p -Quotients of Some Cyclically Presented Groups
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: 3-step Fibonacci sequences in nilpotent groups.