login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A023162 F(n) == -1 (mod n), where F(n) = A000045(n) is the n-th Fibonacci number. 4
1, 2, 3, 4, 7, 13, 14, 17, 23, 26, 34, 37, 43, 46, 47, 53, 67, 73, 74, 83, 86, 94, 97, 103, 106, 107, 113, 127, 134, 137, 146, 157, 163, 166, 167, 173, 193, 194, 197, 206, 214, 223, 226, 227, 233, 254, 257, 263, 274, 277, 283, 293, 307, 313, 314, 317, 326, 334 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

If n is prime then n is in the sequence iff n == 2 or 3 (mod 5).

LINKS

Table of n, a(n) for n=1..58.

FORMULA

a(n) seems to be asymptotic to c*n*log(n) where c=1.5... - Benoit Cloitre, Jan 10 2003

MATHEMATICA

Module[{nn=500, fib}, fib=Thread[{Range[nn], Fibonacci[Range[nn]]}]; Transpose[ Select[fib, Mod[Last[#], First[#]]==First[#]-1&]][[1]]] (* Harvey P. Dale, May 21 2014 *)

CROSSREFS

Sequence in context: A207573 A152605 A285222 * A022437 A057983 A200088

Adjacent sequences:  A023159 A023160 A023161 * A023163 A023164 A023165

KEYWORD

nonn

AUTHOR

David W. Wilson

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy .

Last modified September 25 12:53 EDT 2017. Contains 292469 sequences.