id:A072123 - OEIS Search Results

Search: id:A072123

Displaying 1-1 of 1 results found.

page 1

Remainder when Fibonacci number F[n] is divided by prime number p[n].

+0
1

1, 1, 2, 3, 5, 8, 13, 2, 11, 26, 27, 33, 28, 33, 46, 33, 4, 22, 27, 20, 69, 15, 22, 88, 44, 92, 100, 21, 76, 21, 69, 41, 116, 134, 44, 76, 70, 117, 80, 157, 129, 87, 73, 27, 157, 1, 5, 208, 27, 108, 1, 203, 230, 19, 112, 143, 206, 258, 31, 3, 146, 266, 117, 213, 211, 168 (list; graph; listen)

	OFFSET	`1,3`
	FORMULA	`a[n] = F(n) % p(n), where F(n) is the n-th Fibonacci number, and p(n) is the n-th prime number.`
	EXAMPLE	`a[8] = F[8] % p[8] = 21 % 19 = 2;`
	CROSSREFS	`Sequence in context: A117761 A018149 A118604 this_sequence A135102 A078414 A050416` `Adjacent sequences: A072120 A072121 A072122 this_sequence A072124 A072125 A072126`
	KEYWORD	`easy,nonn`
	AUTHOR	`Randy L. Ekl (Randy.Ekl(AT)Motorola.com), Jun 20 2002`

page 1

Search completed in 0.002 seconds

Last modified July 6 17:22 EDT 2008. Contains 140988 sequences.

AT&T Labs Research