a(1)=1. a(n) = the smallest integer > a(n-1) such that d(a(n)) = d(a(n)-a(n-1)), where d(m) = the number of divisors of m.
1, 3, 5, 7, 15, 17, 19, 27, 29, 31, 39, 41, 43, 51, 53, 74, 79, 85, 91, 106, 109, 115, 123
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
.