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!)
A097565 a(0) = 0, a(1) = 1, a(n) = (a(n-1) mod F(n))*a(n-1) + a(n-2) for n > 2 where F(n) is the n-th Fibonacci number. 1
0, 1, 0, 1, 1, 2, 5, 27, 167, 5204, 177103, 14527650, 959002003, 94955725947, 4084055217724, 179793385305803, 120106065439494128, 183522247784932333387, 256013655766046044568993, 173321428475860957105541648 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,6
COMMENTS
The fractional portion of a(n)/a(n-1) exponentially approaches 0 as n increases.
LINKS
MATHEMATICA
RecurrenceTable[{a[0]==0, a[1]==1, a[n]==Mod[a[n-1], Fibonacci[n]]a[n-1]+ a[n-2]}, a, {n, 20}] (* Harvey P. Dale, Jul 06 2016 *)
PROG
(Magma)
a:= func< n | n le 2 select n-1 else (Self(n-1) mod Fibonacci(n-1))*Self(n-1) + Self(n-2) >;
[a(n): n in [1..21]]; // G. C. Greubel, Apr 20 2021
(Sage)
@CachedFunction
def a(n): return n if (n<2) else (a(n-1)%fibonacci(n))*a(n-1) + a(n-2)
[a(n) for n in (0..20)] # G. C. Greubel, Apr 20 2021
CROSSREFS
Sequence in context: A100105 A087130 A265266 * A079716 A322151 A355765
KEYWORD
nonn
AUTHOR
Gerald McGarvey, Aug 27 2004
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.)