id:A143526 - OEIS Search Results

Search: id:A143526

Displaying 1-1 of 1 results found.

page 1

a(n) = the number of divisors of (A005179(n)+1), where A005179(n) is the smallest positive integer with n divisors.

+0
2

2, 2, 2, 2, 2, 2, 4, 3, 2, 3, 6, 2, 4, 2, 4, 3, 2, 2, 16, 2, 2, 4, 8, 3, 2, 2, 4, 3, 4, 4, 48, 3, 4, 4, 8, 4, 16, 2, 8, 3, 4, 4, 64, 2, 4, 8, 32, 2, 8, 2, 6, 2, 8, 2, 8, 8, 4, 16, 8, 3, 16, 2, 2, 2, 2, 8, 64, 8, 4, 9, 96, 4, 32, 2, 2, 4, 2, 2, 768, 2, 2, 8, 32, 2, 2, 4, 4, 4, 16, 8, 8, 4, 8, 6, 8, 4, 8, 4 (list; graph; listen)

	OFFSET	`1,1`
	FORMULA	`a(n) = A000005(A005179(n)+1). [From Ray Chandler (rayjchandler(AT)sbcglobal.net), Oct 11 2008]`
	CROSSREFS	`Cf. A005179, A143525.` `Sequence in context: A051702 A073130 A064136 this_sequence A072924 A036263 A060447` `Adjacent sequences: A143523 A143524 A143525 this_sequence A143527 A143528 A143529`
	KEYWORD	`nonn`
	AUTHOR	`Leroy Quet (qq-quet(AT)mindspring.com), Aug 22 2008`
	EXTENSIONS	`Extended by Ray Chandler (rayjchandler(AT)sbcglobal.net), Oct 11 2008`

page 1

Search completed in 0.002 seconds

Last modified November 18 20:14 EST 2008. Contains 147244 sequences.

AT&T Labs Research