A115871 Table listing for each n (in descending order) all m's <= n, such that there exists nonzero solutions to a cross-domain congruence m*i = n X i.

1, 2, 3, 4, 5, 6, 7, 3, 8, 9, 10, 11, 7, 12, 13, 5, 14, 6, 15, 16, 17, 18, 19, 15, 20, 21, 13, 22, 14, 23, 19, 15, 24, 25, 9, 26, 10, 27, 15, 28, 12, 29, 21, 13, 30, 31, 27, 11, 32, 33, 34, 35, 31, 36, 37, 29, 38, 30, 39, 35, 40, 41, 25, 42, 26, 43, 27, 44, 28, 45, 46, 38, 30, 47, 27

Offset: 1

Author

Antti Karttunen, Feb 07 2006

Keywords

• nonn
• tabf

Comments

Here * stands for ordinary multiplication and X means carryless (GF(2)[X]) multiplication (A048720).

Examples

			Row n has A115861(n)+1 elements: 1; 2; 3; 4; 5; 6; 7,3; 8; 9; 10; 11,7; 12; 13,5; 14,6; 15; etc.
		

Links

• Index entries for sequences defined by congruent products between domains N and GF(2)[X]

Crossrefs

Cf. A115857, A115859, A115861, A115869, A115872.