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.

A160095 Terms n > 1 of A001065, sorted.

Original entry on oeis.org

3, 4, 6, 6, 7, 8, 8, 9, 10, 11, 12, 13, 13, 14, 14, 15, 15, 16, 16, 17, 17, 18, 19, 19, 20, 20, 21, 21, 21, 22, 22, 23, 23, 24, 25, 25, 25, 26, 27, 27, 28, 29, 29, 30, 31, 31, 31, 31, 31, 32, 32, 33, 33, 33, 34, 35, 35, 35, 36, 37, 37, 37, 37, 38, 39, 40, 40, 40, 41, 41, 41, 41
Offset: 1

Views

Author

Jaroslav Krizek, May 01 2009

Keywords

Comments

Term 1 occurs infinitely often in A001065, therefore terms <= 1 are excluded.
n occurs in the present sequence with multiplicity A048138(n).

Examples

			6 occurs twice in the present sequence because there are two numbers m, viz. 6 and 25, for which A001065(m) = 6.
		

Crossrefs

Cf. A001065 (sum of proper divisors of n), A048138 (a(n) = number of m such that sum of proper divisors of m is n).

Programs

  • Magma
    k:=1700; S:=[ a: n in [1..k] | a gt 1 and a le Sqrt(k) where a is SumOfDivisors(n)-n ]; Sort(~S); S; // Klaus Brockhaus, May 20 2009

Extensions

Edited and extended by Klaus Brockhaus, May 20 2009