id:A076411 - OEIS Search Results

Search: id:A076411

Displaying 1-1 of 1 results found.

page 1

Number of perfect powers < n.

+0
3

0, 1, 1, 1, 2, 2, 2, 2, 3, 4, 4, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 5, 5, 5, 5, 6, 6, 7, 7, 7, 7, 7, 8, 8, 8, 8, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 12, 12, 12, 12, 12 (list; graph; listen)

	OFFSET	`1,5`
	COMMENT	`Perfect powers are in A001597. The function a(n) is much more slower increasing function than pi(n): e.g. a(1765)=54 and pi(1765)=274. See also A076412.`
	EXAMPLE	`ppn(9)=3 because there are 3 perfect powers less than 9: 1,4,8.`
	CROSSREFS	`Cf. A001597, A076412. A069623 is another version.` `Sequence in context: A025425 A085501 A069623 this_sequence A072613 A029551 A171482` `Adjacent sequences: A076408 A076409 A076410 this_sequence A076412 A076413 A076414`
	KEYWORD	`nonn`
	AUTHOR	`Zak Seidov (zakseidov(AT)yahoo.com), Oct 09 2002`

page 1

Search completed in 0.002 seconds

Last modified March 17 15:31 EDT 2010. Contains 173524 sequences.

AT&T Labs Research