Sir John Colquhoun, 1st Baronet

Sir John Colquhoun (c.1596 – aft. 8 November 1647),[1] Sixteenth Lord Colquhoun and the Eighteenth of Luss,[2] was the first Colquhoun baronet of Nova Scotia, Canada. The Baronetage of the Colquhoun clan of Nova Scotia was established on 30 August 1625.[3]

Sir John Colquhoun
Bornc. 1596
NationalityScotland
Known forBaronet

Colquhoun was born in Scotland, probably in 1596, as his parents were married in 1595.[2] He was the eldest son of Sir Alexander Colquhoun and Lady Helen Buchanan.[4]

In 1620, he married Lady Lilias Graham, eldest daughter of John Graham, Fourth Earl of Montrose, and elder sister of the Great Montrose,[5] which was what her younger brother, James Graham, 5th Earl of Montrose, came to be known, in addition to being the Marquis of Montrose. In 1632 Sir John was accused of absconding his wife's sister, Lady Catherine Graham. It was alleged that he had used witchcraft and sorcery to accomplish this. As a fugitive he was excommunicated and his estates forfeited.[6]

When and where John died is unknown. He was alive on 8 November 1647.[7]

Footnotes
  1. Fraser, William (1869). The Chiefs of Colquhoun and Their Country. Edinburgh: Printed by T. and A. Constable. pp. 232–254. OL 13502864M.
  2. Fraser, William (1869). The Chiefs of Colquhoun and Their Country. Edinburgh: Printed by T. and A. Constable. p. 239. OL 13502864M.
  3. Fraser, William (1869). The Chiefs of Colquhoun and Their Country. Edinburgh: Printed by T. and A. Constable. p. 245. OL 13502864M.
  4. Fraser, William (1869). The Chiefs of Colquhoun and Their Country. Edinburgh: Printed by T. and A. Constable. p. 232. OL 13502864M.
  5. Fraser, William (1869). The Chiefs of Colquhoun and Their Country. Edinburgh: Printed by T. and A. Constable. p. 242. OL 13502864M.
  6. Scottish Clan & Family History Encyclopedia. HarperCollins. 1994. p. 109. ISBN 0004705475.
  7. Fraser, William (1869). The Chiefs of Colquhoun and Their Country. Edinburgh: Printed by T. and A. Constable. p. 250. OL 13502864M.
gollark: It *does* do this, that's just unavailable in this channel.
gollark: Wait, this is just an arbitrary random number.
gollark: So I'm using it on a big number which it is not optimized for.
gollark: > Factoring large numbers is, in general, hard. The Pollard-Brent rho algorithm used by factor is particularly effective for numbers with relatively small factors. If you wish to factor large numbers which do not have small factors (for example, numbers which are the product of two large primes), other methods are far better. Oh bee.
gollark: This is the GNU coreutils one.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.