Refactorable numbers - A machine invention

Research output: Contribution to journalArticleResearchpeer-review

19 Citations (Scopus)

Abstract

The HR (or Hardy-Ramanujan) program invents and analyses definitions in areas of pure mathematics, including finite algebras, graph theory and number theory. While working in number theory, HR recently invented a new integer sequence, the refactorable numbers, which are defined and developed here. A discussion of how HR works, along with details of well known sequences reinvented by HR and other new sequences invented by HR is also given.

Original languageEnglish
JournalJournal of Integer Sequences
Volume2
Issue number2
Publication statusPublished - 1 Dec 1999
Externally publishedYes

Cite this