

A175502


a(1) = 1. a(n) = the smallest integer not yet occurring such that each unordered pair {d(a(k)),d(a(k1))} occurs only once at most, for 2<= k <= n, where d(m) = the number of divisors of m.


3



1, 2, 3, 4, 6, 5, 12, 8, 10, 16, 7, 24, 9, 18, 20, 30, 14, 36, 11, 48, 15, 60, 13, 64, 21, 120, 17, 144, 22, 180, 19, 192, 25, 49, 72, 28, 80, 40, 42, 81, 32, 100, 54, 84, 90, 112, 121, 168, 44, 240, 23, 360, 26, 320, 45, 252, 56, 210, 96, 196
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,2


COMMENTS

This sequence seems likely to be a permutation of the positive integers. Is it?


LINKS



CROSSREFS



KEYWORD

nonn


AUTHOR



EXTENSIONS



STATUS

approved



