|
%I #5 Mar 31 2012 10:23:25
%S 1,1,1,1,1,1,3,1,1,1,2,1,6,1,1,1,8,1,2,1,1,1,11,1,1,1,1,1,4,1,2,1,2,1,
%T 1,1,18,1,1,1,42,1,21,1,1,1,69,1,3,1,1,1,26,1,1,1,1,1,2,1,62,1,1,1,1,
%U 1,33,1,1,1,2,1,36,1,1,1,2,1,2,1,1,1,41,1,1,1,4,1,180,1,3,1,1,1,1,1,48,1,2,1
%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 nontrivial periods of minimal length.
%K nonn
%O 1,7
%A _Phil Carmody_
%E More terms from Larry Reeves (larryr(AT)acm.org), Jan 06 2005
|
