id:A160095 - OEIS Search Results

Search: id:A160095

Displaying 1-1 of 1 results found.

page 1

Terms n > 1 of A001065, sorted.

+0
2

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 (list; graph; listen)

	OFFSET	`1,1`
	COMMENT	`Term 1 ocurrs infinitely often in A001065, therefore terms <= 1 are excluded.` `n occurs in the present sequence with multiplicity A048138(n).`
	EXAMPLE	`6 occurs twice in the present sequence because there are two numbers m, viz. 6 and 25, for which A001065(m) = 6.`
	PROGRAM	`(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; [From Klaus Brockhaus, May 20 2009]`
	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).` `Sequence in context: A033957 A031131 A105321 this_sequence A135319 A004219 A077542` `Adjacent sequences: A160092 A160093 A160094 this_sequence A160096 A160097 A160098`
	KEYWORD	`nonn`
	AUTHOR	`Jaroslav Krizek (jaroslav.krizek(AT)atlas.cz), May 01 2009`
	EXTENSIONS	`Edited and extended by Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), May 20 2009`

page 1

Search completed in 0.002 seconds

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.

AT&T Labs Research