Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A121104
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A121104 Fibonacci numbers modulo the Prime numbers: A00045 modulo A000040. +0
1
1, 1, 2, 3, 5, 8, 13, 21, 5, 24, 15, 21, 18, 1, 27, 43, 11, 38, 63, 49, 44, 32, 88, 2, 83, 59, 73, 76, 79, 63, 113, 9, 94, 61, 6, 123, 76, 149, 127, 34, 74, 124, 32, 83, 1, 3, 91, 212, 204, 232, 85, 76, 171, 141, 148, 234, 145, 38, 2, 271, 208, 179, 194, 73, 14, 127, 177 (list; graph; listen)
OFFSET

0,3

FORMULA

a(n) = Fibonacci(n) modulo Prime(n).

EXAMPLE

a(9)=5 because the 9th Fibonacci=34, the 9th Prime=29 and 34 mod 29=5.

CROSSREFS

Cf. A000040, A000045.

Sequence in context: A100582 A093093 A137290 this_sequence A118627 A080787 A065124

Adjacent sequences: A121101 A121102 A121103 this_sequence A121105 A121106 A121107

KEYWORD

nonn

AUTHOR

Gil Broussard (gilbroussard(AT)bellsouth.net), Aug 12 2006

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 24 23:16 EST 2009. Contains 167481 sequences.


AT&T Labs Research