id:A161841 - OEIS Search Results

Search: id:A161841

Displaying 1-1 of 1 results found.

page 1

Number of factors, with repetition, in all distinct pairs (a=<b) such that a*b = n.

+0
6

2, 2, 2, 4, 2, 4, 2, 4, 4, 4, 2, 6, 2, 4, 4, 6, 2, 6, 2, 6, 4, 4, 2, 8, 4, 4, 4, 6, 2, 8, 2, 6, 4, 4, 4, 10, 2, 4, 4, 8, 2, 8, 2, 6, 6, 4, 2, 10, 4, 6, 4, 6, 2, 8, 4, 8, 4, 4, 2, 12, 2, 4, 6, 8, 4, 8, 2, 6, 4, 8, 2, 12, 2, 4, 6, 6, 4, 8, 2, 10, 6, 4, 2, 12, 4, 4, 4, 8, 2, 12, 4, 6, 4, 4, 4, 12, 2, 6, 6, 10 (list; graph; listen)

	OFFSET	`1,1`
	FORMULA	`a(n) = A000005(n)+A010052(n) = A038548(n)*2.`
	EXAMPLE	`For n = 16 the a(16)=6 because there are three distict pairs (a=<b) such that a*b = n: The pairs (1,16), (2,8) and (4,4). So, the number of factors, with repetition, in all the pairs is equal to 6.`
	CROSSREFS	`Cf. A000005, A010052, A038548, A161842.` `Sequence in context: A108920 A079405 A072048 this_sequence A152674 A072056 A066012` `Adjacent sequences: A161838 A161839 A161840 this_sequence A161842 A161843 A161844`
	KEYWORD	`easy,nonn`
	AUTHOR	`Omar E. Pol (info(AT)polprimos.com), Jun 23 2009`

page 1

Search completed in 0.002 seconds

Last modified November 30 13:13 EST 2009. Contains 167758 sequences.

AT&T Labs Research