|
Search: id:A088551
|
|
|
| A088551 |
|
Fibonacci winding number: the number of 'mod n' operations in one cycle of the Fibonacci sequence modulo n. |
|
+0
1
|
|
| 1, 3, 2, 8, 11, 7, 4, 11, 28, 3, 9, 12, 23, 19, 9, 16, 11, 7, 28, 5, 12, 23, 9, 48, 40, 35, 19, 4, 59, 12, 19, 15, 16, 39, 9, 36, 6, 27, 28, 19, 19, 43, 11, 59, 23, 15, 9, 55, 148, 35, 38, 52, 35, 6, 21, 31, 16, 26, 57, 28, 12, 21, 43, 68, 51, 67, 14, 19, 119, 32, 7, 72, 112, 99, 5, 33
(list; graph; listen)
|
|
|
OFFSET
|
2,2
|
|
|
COMMENT
|
If pi(n) is the n-th Pisano number (A001175) then a(n) is usually about pi(n)/2 - and in any case a(n)>pi(n)/4
|
|
LINKS
|
T. D. Noe, Table of n, a(n) for n=2..10000
R. C. Johnson, Fibonacci Numbers and Resources.
|
|
EXAMPLE
|
a(8)=4 because one cycle of the Fibonacci numbers modulo 8 is 0, 1, 1, 2, 3, 5; 0, 5, 5; 2, 7; 1; - including 4 'mod 8' operations, each marked with a semi-colon.
|
|
CROSSREFS
|
Cf. A001175, A015134.
Sequence in context: A163356 A095013 A094188 this_sequence A165660 A107300 A047946
Adjacent sequences: A088548 A088549 A088550 this_sequence A088552 A088553 A088554
|
|
KEYWORD
|
easy,nice,nonn
|
|
AUTHOR
|
R C Johnson (bob.johnson(AT)dur.ac.uk), Nov 19 2003
|
|
EXTENSIONS
|
More terms from T. D. Noe (noe(AT)sspectra.com)
Edited by Ray Chandler (rayjchandler(AT)sbcglobal.net), Oct 26 2006
|
|
|
Search completed in 0.002 seconds
|
