The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A248740

(Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing entries 1-10 | older changes

A248740

a(n) = Fibonacci(n) mod 1000.
(history; published version)

#20 by Charles R Greathouse IV at Thu Sep 08 08:46:10 EDT 2022

PROG

(MAGMAMagma) [Fibonacci(n) mod 1000: n in [0..80]]; // Vincenzo Librandi, Oct 17 2014

Discussion

Thu Sep 08

08:46

OEIS Server: https://oeis.org/edit/global/2944

#19 by Alois P. Heinz at Wed Nov 07 21:57:27 EST 2018

STATUS

editing

approved

#18 by Alois P. Heinz at Wed Nov 07 21:57:24 EST 2018

NAME

a(n) = Fibonacci(n) mod 1000.

STATUS

approved

editing

#17 by Alois P. Heinz at Sun Oct 18 09:08:13 EDT 2015

STATUS

editing

approved

#16 by Alois P. Heinz at Sun Oct 18 09:08:09 EDT 2015

LINKS

Alois P. Heinz, <a href="/A248740/b248740.txt">Table of n, a(n) for n = 0..3000</a>

MAPLE

a:= proc(n) option remember;

`if`(n<2, n, irem(a(n-1)+a(n-2), 1000))

end:

seq(a(n), n=0..60); # Alois P. Heinz, Oct 18 2015

STATUS

approved

editing

#15 by Ray Chandler at Thu Aug 27 17:14:00 EDT 2015

STATUS

editing

approved

#14 by Ray Chandler at Thu Aug 27 17:13:55 EDT 2015

LINKS

<a href="/index/Rec#order_1500">Index entries for linear recurrences with constant coefficients</a>, order 1500.

STATUS

approved

editing

#13 by Alois P. Heinz at Sun Nov 09 18:37:31 EST 2014

STATUS

proposed

approved

#12 by Jon E. Schoenfield at Fri Oct 24 21:33:46 EDT 2014

STATUS

editing

proposed

#11 by Jon E. Schoenfield at Fri Oct 24 21:33:44 EDT 2014

COMMENTS

A number m of {0, 1, ..., 999} is not in the range of this sequence, iff m is congruent to 4 or 6 mod 8.

These numbers are the 250 = 1000 - A066853(1000) numbers of the set {4, 6, 12, 14,.. ..., 996, 998}. E.g. , a Fibonacci number will never end in the digits '100'.

STATUS

proposed

editing