id:A008481 - OEIS Search Results

Search: id:A008481

Displaying 1-1 of 1 results found.

page 1

If n = Product (p_j^k_j) then a(n) = Sum partition(k_j).

+0
2

1, 1, 1, 2, 1, 2, 1, 3, 2, 2, 1, 3, 1, 2, 2, 5, 1, 3, 1, 3, 2, 2, 1, 4, 2, 2, 3, 3, 1, 3, 1, 7, 2, 2, 2, 4, 1, 2, 2, 4, 1, 3, 1, 3, 3, 2, 1, 6, 2, 3, 2, 3, 1, 4, 2, 4, 2, 2, 1, 4, 1, 2, 3, 11, 2, 3, 1, 3, 2, 3, 1, 5, 1, 2, 3, 3, 2, 3 (list; graph; listen)

	OFFSET	`1,4`
	MATHEMATICA	`Prepend[ Array[ Plus @@ (PartitionsP /@ Last[ Transpose[ FactorInteger[ # ] ] ])&, 100, 2 ], 1 ]`
	CROSSREFS	`Sequence in context: A001222 A098893 A069248 this_sequence A127669 A056692 A039637` `Adjacent sequences: A008478 A008479 A008480 this_sequence A008482 A008483 A008484`
	KEYWORD	`nonn`
	AUTHOR	`Olivier Gerard (olivier.gerard(AT)gmail.com)`

page 1

Search completed in 0.002 seconds

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

AT&T Labs Research