id:A070172 - OEIS Search Results

Search: id:A070172

Displaying 1-1 of 1 results found.

page 1

Smallest k such that sigma(k)=>n.

+0
3

1, 2, 2, 3, 4, 4, 4, 6, 6, 6, 6, 6, 8, 8, 8, 10, 10, 10, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 16, 16, 16, 18, 18, 18, 18, 18, 18, 18, 18, 20, 20, 20, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 36, 36 (list; graph; listen)

	OFFSET	`1,2`
	COMMENT	`Also smallest m to partition n into distinct divisors of m; hihgly abundant numbers are record values: a(i)<A002093(n) for 1<=i<A085443(n), A002093(n)=a(A085443(n)). - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Jun 30 2003`
	FORMULA	`It seems that lim n -> infinity a(n)/n*ln(ln(n))=C=0, 6...`
	PROGRAM	`(PARI) for(n=1, 150, s=1; while(sigma(s)<n, s++); print1(s, ", "))`
	CROSSREFS	`Sequence in context: A006165 A131807 A104351 this_sequence A130128 A049980 A141525` `Adjacent sequences: A070169 A070170 A070171 this_sequence A070173 A070174 A070175`
	KEYWORD	`easy,nonn`
	AUTHOR	`Benoit Cloitre (benoit7848c(AT)orange.fr), May 06 2002`

page 1

Search completed in 0.002 seconds

Last modified December 10 12:37 EST 2009. Contains 170569 sequences.

AT&T Labs Research