References to A160689

a(1)=1. a(n) = the smallest positive integer such that d(a(n)) = d(sum{k=1 to n} a(k)), where d(m) = the number of divisors of m.
1, 2, 2, 2, 8, 2, 2, 8, 2, 2, 8, 2, 2, 8, 2, 21, 5, 6, 6, 15, 3, 6, 8, 6, 2, 10, 12, 6, 12, 2, 10


7 seqfan posts

Thu May 28 23:16:07 CEST 2009    [seqfan] Re: d(a(n)) = d(a(n)-a(n-1))
Thu May 28 22:14:12 CEST 2009    [seqfan] d(a(n)) = d(a(n)-a(n-1))
Thu May 28 13:57:48 CEST 2009    [seqfan] Re: d(a(n)) = d(a(n)-a(n-1))
Thu May 28 13:57:48 CEST 2009    [seqfan] Re: d(a(n)) = d(a(n)-a(n-1))
Thu May 28 13:57:48 CEST 2009    [seqfan] Re: d(a(n)) = d(a(n)-a(n-1))
Thu May 28 13:57:47 CEST 2009    [seqfan] Re: d(a(n)) = d(a(n)-a(n-1))
Sun May 24 15:55:31 CEST 2009    [seqfan] d(a(n)) = d(a(n)-a(n-1))

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 .