login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A171063
Table read by antidiagonals: T(n,m)=number of nonzero period n solutions of x(i)=(x(i-1)+x(i-2)) mod m (n>=1, m>=1).
3
0, 0, 0, 0, 0, 0, 0, 0, 3, 0, 0, 0, 0, 0, 0, 0, 0, 3, 0, 0, 0, 0, 0, 0, 0, 0, 3, 0, 0, 0, 3, 4, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 0, 0, 0, 0, 0, 3, 0, 0, 0, 0, 8, 3, 0, 0, 0, 0, 0, 0, 3, 0, 0, 0, 0, 0, 0, 0, 3, 0, 0, 0, 0, 4, 3, 0, 0, 0, 0, 0, 0, 4, 0, 15, 0, 8, 0, 0, 0, 3, 0, 0, 0, 3, 0, 0, 0, 0, 0, 3, 0, 0, 0, 0, 0, 0
OFFSET
1,9
LINKS
EXAMPLE
Table starts
0...0...0...0...0...0...0...0...0...0...0...0...0...0...0...0...0...0...0
0...0...0...0...0...0...0...0...0...0...0...0...0...0...0...0...0...0...0
0...3...0...3...0...3...0...3...0...3...0...3...0...3...0...3...0...3...0
0...0...0...0...4...0...0...0...0...4...0...0...0...0...4...0...0...0...0
0...0...0...0...0...0...0...0...0...0..10...0...0...0...0...0...0...0...0
0...3...0..15...0...3...0..15...0...3...0..15...0...3...0..15...0...3...0
0...0...0...0...0...0...0...0...0...0...0...0...0...0...0...0...0...0...0
0...0...8...0...4...8...0...0...8...4...0...8...0...0..44...0...0...8...0
0...3...0...3...0...3...0...3...0...3...0...3...0...3...0...3...0...3..18
0...0...0...0...0...0...0...0...0...0.120...0...0...0...0...0...0...0...0
0...0...0...0...0...0...0...0...0...0...0...0...0...0...0...0...0...0...0
0...3...0..15...4...3...0..63...0..19...0..15...0...3...4..63...0...3...0
0...0...0...0...0...0...0...0...0...0...0...0...0...0...0...0...0...0...0
0...0...0...0...0...0...0...0...0...0...0...0...0...0...0...0...0...0...0
0...3...0...3...0...3...0...3...0...3..10...3...0...3...0...3...0...3...0
0...0...8...0...4...8..48...0...8...4...0...8...0..48..44...0...0...8...0
0...0...0...0...0...0...0...0...0...0...0...0...0...0...0...0...0...0...0
0...3...0..15...0...3...0..15...0...3...0..15...0...3...0..15...0...3.360
0...0...0...0...0...0...0...0...0...0...0...0...0...0...0...0...0...0...0
0...0...0...0..24...0...0...0...0..24.120...0...0...0..24...0...0...0...0
For n=12, m=10 there are 19 (including shifted multiplicities):
1: 0 5 5 0 5 5 0 5 5 0 5 5
2: 5 0 5 5 0 5 5 0 5 5 0 5
3: 5 5 0 5 5 0 5 5 0 5 5 0
4: 1 3 4 7 1 8 9 7 6 3 9 2
5: 1 8 9 7 6 3 9 2 1 3 4 7
6: 6 3 9 2 1 3 4 7 1 8 9 7
7: 6 8 4 2 6 8 4 2 6 8 4 2
8: 2 1 3 4 7 1 8 9 7 6 3 9
9: 2 6 8 4 2 6 8 4 2 6 8 4
10: 7 1 8 9 7 6 3 9 2 1 3 4
11: 7 6 3 9 2 1 3 4 7 1 8 9
12: 4 2 6 8 4 2 6 8 4 2 6 8
13: 4 7 1 8 9 7 6 3 9 2 1 3
14: 9 2 1 3 4 7 1 8 9 7 6 3
15: 9 7 6 3 9 2 1 3 4 7 1 8
16: 3 4 7 1 8 9 7 6 3 9 2 1
17: 3 9 2 1 3 4 7 1 8 9 7 6
18: 8 4 2 6 8 4 2 6 8 4 2 6
19: 8 9 7 6 3 9 2 1 3 4 7 1
CROSSREFS
Sequence in context: A320659 A062535 A063667 * A308229 A318673 A151795
KEYWORD
nonn,tabl
AUTHOR
R. H. Hardin Sep 05 2010
STATUS
approved