login
Consider Fibonacci-type sequences b(0)=X, b(1)=Y, b(k)=b(k-1)+b(k-2) mod n; all are periodic; sequence gives number of maximal length periods.
0

%I #5 Mar 31 2012 10:23:25

%S 1,1,1,2,1,1,3,4,3,1,11,5,6,3,4,8,8,13,19,5,27,11,11,21,5,6,9,15,58,4,

%T 31,16,24,32,12,53,18,76,24,21,42,27,21,59,12,44,69,93,21,5,32,30,26,

%U 36,145,63,40,58,59,20,62,124,72,32,24,24,33,128,99,12,71,213,36,18,20,316

%N Consider Fibonacci-type sequences b(0)=X, b(1)=Y, b(k)=b(k-1)+b(k-2) mod n; all are periodic; sequence gives number of maximal length periods.

%K nonn

%O 1,4

%A _Phil Carmody_

%E More terms from Larry Reeves (larryr(AT)acm.org), Jan 06 2005