A New Kind of Fibonacci-Like Sequence of Composite Numbers
Dan Ismailescu
Department of Mathematics
Hofstra University
103 Hofstra University
Hempstead, NY 11549
USA
Jaesung Son
Ridgewood High School
627 East Ridgewood Avenue
Ridgewood, NJ 07450
USA
Abstract:
An integer sequence (xn)n≥0 is said to be Fibonacci-like if it satisfies the binary recurrence relation
xn = xn−1 +
xn−2, n ≥ 2.
We construct a new type of Fibonacci-like sequence of composite numbers.
Full version: pdf,
dvi,
ps,
latex
(Concerned with sequences
A082411
A083103
A083104
A083105
A083216
A221286.)
Received March 24 2014;
revised version received July 8 2014; July 21 2014.
Published in Journal of Integer Sequences, July 25 2014.
Return to
Journal of Integer Sequences home page