id:A111419 - OEIS Search Results

Search: id:A111419

Displaying 1-1 of 1 results found.

page 1

a(n) is the smallest positive integer for which the equation (fibo(n+a(n)) - fibo(n)) = 0 (mod n) is correct, where fibo(n) denotes the n-th Fibonacci number.

+0
1

1, 2, 2, 6, 5, 15, 2, 9, 6, 10, 1, 12, 2, 9, 10, 24, 2, 24, 1, 5, 6, 7, 2, 12, 25, 15, 18, 48, 1, 15, 1, 11, 14, 19, 10, 12, 2, 15, 34, 60, 1, 15, 2, 30, 30, 25, 2, 12, 14, 50, 42, 78, 2, 24, 10, 24, 30, 13, 1, 60, 1, 27, 18, 96, 10, 120, 2, 36, 6, 25, 1, 12, 2, 39, 50, 18, 6, 39, 1, 35 (list; graph; listen)

	OFFSET	`1,2`
	COMMENT	`When a(n)=2, n is often prime. The exceptions (323,377,2834...) are in A069107.`
	EXAMPLE	`a(3) = 2 because fibo(3+2) - fibo(3) = 5-2 = 0 mod 3 and 2 is the smallest integer for which this equation is correct.`
	PROGRAM	`(MUPAD): for n from 1 to 100 do an := 0; repeat an := an+1; until (numlib::fibonacci(n+an)-numlib::fibonacci(n)) mod n = 0 end_repeat; print(an); end_for;`
	CROSSREFS	`Sequence in context: A115255 A055924 A054917 this_sequence A056881 A060779 A029594` `Adjacent sequences: A111416 A111417 A111418 this_sequence A111420 A111421 A111422`
	KEYWORD	`nonn`
	AUTHOR	`Stefan Steinerberger (hansibal(AT)hotmail.com), Nov 13 2005`

page 1

Search completed in 0.002 seconds

Last modified August 19 23:53 EDT 2008. Contains 142930 sequences.

AT&T Labs Research