Answer…

…to yesterday’s question, as

was first to get: the nth number in the qsequence is the lowest integer with n divisors.

1
1, 2
1, 2, 4
1, 2, 3, 6
1, 2, 4, 8, 16
1, 2, 3, 4, 6, 12
1, 2, 4, 8, 16, 32, 64
1, 2, 3, 4, 6, 8, 12, 24
1, 2, 3, 4, 6, 9, 12, 18, 36
1, 2, 3, 4, 6, 8, 12, 16, 24, 48

so

1, 2, 4, 8, 16, 32, 64, 128, 256, 512, 1024
1, 2, 3, 4, 5, 6, 10, 12, 15, 20, 30, 60

etc.

This entry was posted in Uncategorised. Bookmark the permalink.

1 Response to Answer…

  1. major_clanger says:

    I’ll be there with , busy getting people to vote for Bradford for 2013 🙂

Comments are closed.