login
a(1)=2. a(n) = the smallest integer > a(n-1) such that d(a(n)) <= d(n), where d(n) = the number of divisors of n.
2

%I #10 Mar 11 2014 01:32:32

%S 2,3,5,7,11,13,17,19,23,25,29,31,37,38,39,41,43,44,47,49,51,53,59,61,

%T 67,69,71,73,79,81,83,85,86,87,89,91,97,101,103,104,107,109,113,115,

%U 116,118,127,128,131,133,134,137,139,141,142,143,145

%N a(1)=2. a(n) = the smallest integer > a(n-1) such that d(a(n)) <= d(n), where d(n) = the number of divisors of n.

%C Starting the sequence with a(1)=1 instead would have lead to a(n) = n for all n, obviously.

%Y Cf. A137518, A161576, A161577.

%K nonn

%O 1,1

%A _Leroy Quet_, Jun 14 2009

%E More terms from _Sean A. Irvine_, Feb 23 2011