login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A053521 a(n) = floor(A*a(n-1) + B*a(n-2) + C)/p^r, where p^r is the highest power of p dividing floor(A*a(n-1) + B*a(n-2) + C), A=1.0001, B=1.0001, C=1, p=2. 2
1, 1, 3, 5, 9, 15, 25, 41, 67, 109, 177, 287, 465, 753, 1219, 1973, 3193, 5167, 8361, 6765, 1891, 8657, 5275, 6967, 3061, 5015, 8077, 6547, 7313, 6931, 7123, 1757, 8881, 665, 9547, 5107, 229, 5337, 5567, 5453, 5511, 5483, 2749, 8233, 1373, 9607 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
COMMENTS
Becomes a cyclic sequence whose period is 4793. If A=1, B=1, C=0, p=1, a(1)=a(2)=1 then it is the Fibonacci Sequence.
LINKS
CROSSREFS
Sequence in context: A080430 A053523 A053522 * A128587 A001595 A092369
KEYWORD
nonn
AUTHOR
EXTENSIONS
a(33) corrected by Sean A. Irvine, Dec 27 2021
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 28 05:39 EDT 2024. Contains 371235 sequences. (Running on oeis4.)