id:A078345 - OEIS Search Results

Search: id:A078345

Displaying 1-1 of 1 results found.

page 1

Numbers n such that F(n) mod n divides F(F(n) mod n) where F(k) denotes the k-th Fibonacci number.

+0
1

1, 2, 5, 8, 10, 11, 12, 13, 19, 20, 21, 22, 24, 25, 26, 29, 31, 32, 36, 37, 38, 41, 44, 48, 49, 50, 55, 58, 59, 60, 61, 62, 65, 71, 72, 73, 79, 80, 82, 84, 89, 95, 96, 97, 101, 104, 108, 109, 118, 120, 122, 125, 131, 132, 139, 140, 142, 144, 145, 149, 151, 155, 156 (list; graph; listen)

	OFFSET	`1,2`
	FORMULA	`Conjecture: a(n) is asymptotic to cnlog(n) with c>0.7`
	EXAMPLE	`F(44) = 701408733; 701408733 mod 44 = 25, F(25)=75025 and 25 divides 75025, hence 44 is in the sequence.`
	CROSSREFS	`Sequence in context: A083724 A072476 A167541 this_sequence A161817 A080228 A153052` `Adjacent sequences: A078342 A078343 A078344 this_sequence A078346 A078347 A078348`
	KEYWORD	`nonn`
	AUTHOR	`Benoit Cloitre (benoit7848c(AT)orange.fr), Nov 22 2002`

page 1

Search completed in 0.002 seconds

Last modified December 15 00:47 EST 2009. Contains 170825 sequences.

AT&T Labs Research