Smallest number such that no two divisors of n are congruent modulo a(n).
1, 2, 3, 4, 3, 6, 4, 5, 5, 6, 3, 7, 5, 8, 8, 9, 3, 10, 4, 7, 8, 6, 3, 13, 7, 7, 5, 11, 3, 11, 4, 9
4 seqfan posts
Tue Dec 1 10:12:32 CET 2009 [seqfan] Re: Proof
Tue Dec 1 10:08:38 CET 2009 [seqfan] Re: Proof
Tue Dec 1 08:03:00 CET 2009 [seqfan] Proof
Sat Oct 31 11:58:22 CET 2009 [seqfan] Divisor congruences
Index of A-numbers in seqfan: by ascending order
by month
by frequency
by keyword
Links to OEIS content are included according to
The OEIS End-User License Agreement
.