cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A212489 Numbers n such that A001065(x)*x = n has at least two solutions, where x is a deficient number.

Original entry on oeis.org

1245335, 318047135, 358491735, 533718135, 709131500, 1122571695, 1814416175, 3565970135, 4486354631, 14336906175, 14827262351, 22805269551, 36360557831, 43971297884, 72370166375, 99254203895, 102204949847, 145262865020, 156161459559, 173741271935, 231267964895
Offset: 1

Views

Author

Naohiro Nomoto, May 18 2012

Keywords

Examples

			Example: For n=1245335, A001065(1955)*1955 = 1245335, A001065(2093)*2093 = 1245335, A001065(1955) < 1955, A001065(2093) < 2093, therefore 1245335 is included in this sequence.
		

Crossrefs

Extensions

a(6)-a(21) from Donovan Johnson, May 21 2012