id:A023162 - OEIS Search Results

Search: id:A023162

Displaying 1-1 of 1 results found.

page 1

F(n) == -1 (mod n), where F(n) = A000045(n) is the n-th Fibonacci number.

+0
5

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; listen)

	OFFSET	`1,2`
	COMMENT	`If n is prime then n is in the sequence iff n == 2 or 3 (mod 5).`
	FORMULA	`a(n) seems to be asymptotic to cnlog(n) where c=1.5... - Benoit Cloitre (benoit7848c(AT)orange.fr), Jan 10 2003`
	CROSSREFS	`Sequence in context: A124390 A107031 A152605 this_sequence A022437 A057983 A096723` `Adjacent sequences: A023159 A023160 A023161 this_sequence A023163 A023164 A023165`
	KEYWORD	`nonn`
	AUTHOR	`David W. Wilson (davidwwilson(AT)comcast.net)`

page 1

Search completed in 0.004 seconds

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.

AT&T Labs Research