Search: id:A109465 Results 1-1 of 1 results found. %I A109465 %S A109465 1,2,6,3,10,4,12,5,14,7,15,8,18,9,20,11,21,13,22,16,24,17,26,19,28,23, %T A109465 30,25,33,27,34,29,35,31,36,32,38,37,39,41,40,42,43,44,47,45,49,46,53, %U A109465 48,59,50,60,51,61,52,64,54,66,55,67,56,70,57,71,58,73,62,78,63,79,65 %N A109465 a(1)=1; for n>1, a(n) = smallest positive integer not among the earlier terms of the sequence that is divisible by a different number of distinct primes than a(n-1). %C A109465 Sequence is a permutation of the positive integers. %H A109465 Leroy Quet, Home Page (listed in lieu of email address) %e A109465 Of the positive integers (4,5,7,8,9,10,11,...) not among the first 4 terms of the sequence, 10 is the smallest which is divisible by a different number of distinct primes than a(4) = 3. So a(5) = 10. %Y A109465 Cf. A001221. %Y A109465 Sequence in context: A136190 A079297 A143219 this_sequence A090705 A130684 A079178 %Y A109465 Adjacent sequences: A109462 A109463 A109464 this_sequence A109466 A109467 A109468 %K A109465 nonn %O A109465 1,2 %A A109465 Leroy Quet Aug 28 2005 %E A109465 Extended by Ray Chandler (rayjchandler(AT)sbcglobal.net), Aug 28 2005 Search completed in 0.001 seconds