OFFSET
1,2
COMMENTS
See A046738 for the period of the tribonacci numbers mod n. The ratio of the period to the reduced period is either 1 or 3. Robinson discusses the relationship between the period and the reduced period of a sequence. For the Fibonacci numbers, the analogous sequence is A001177. - T. D. Noe, Jan 14 2009
LINKS
T. D. Noe, Table of n, a(n) for n=1..1000
D. W. Robinson, A note on linear recurrent sequences modulo m, Amer. Math. Monthly 73 (1966), 619-621.
EXAMPLE
From T. D. Noe, Jan 14 2009: (Start)
The tribonacci sequence (starting with 1) mod 7 has a period that repeats
1, 1, 2, 4, 0, 6, 3, 2, 4, 2, 1, 0, 3, 4, 0, 0,
4, 4, 1, 2, 0, 3, 5, 1, 2, 1, 4, 0, 5, 2, 0, 0,
2, 2, 4, 1, 0, 5, 6, 4, 1, 4, 2, 0, 6, 1, 0, 0.
The first pair of zeros occurs at the 16th term. Hence a(7)=16.
(End)
CROSSREFS
KEYWORD
nonn
AUTHOR
EXTENSIONS
Improved name from T. D. Noe, Jan 14 2009
STATUS
approved
