id:A057523 - OEIS Search Results

Search: id:A057523

Displaying 1-1 of 1 results found.

page 1

Number of ways n-th powerful (1) number can be expressed as b^2*c^3.

+0
1

1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 1, 1 (list; graph; listen)

	OFFSET	`1,11`
	COMMENT	`Always positive. (Would be zero for any non powerful number).`
	EXAMPLE	`a(40)=2 since 40th powerful number is 576=24^21^3=3^24^3`
	CROSSREFS	`Cf. A001694.` `Sequence in context: A055229 A062379 A043288 this_sequence A083235 A043287 A043286` `Adjacent sequences: A057520 A057521 A057522 this_sequence A057524 A057525 A057526`
	KEYWORD	`nonn`
	AUTHOR	`Henry Bottomley (se16(AT)btinternet.com), Sep 02 2000`

page 1

Search completed in 0.002 seconds

Last modified November 21 14:49 EST 2008. Contains 150807 sequences.

AT&T Labs Research