id:A078899 - OEIS Search Results

Search: id:A078899

Displaying 1-1 of 1 results found.

page 1

Number of times the greatest prime factor of n is the greatest prime factor for numbers <=n; a(1)=1.

+0
3

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

	OFFSET	`1,4`
	COMMENT	`For n>1: a(n)=1 iff n is prime;` `a(n) = n/p for n<=p*(p+1) and p = greatest prime factor of n.`
	FORMULA	`Ordinal transform of A006530 (Gpf). - Frank Adams-Watters (FrankTAW(AT)Netscape.net), Aug 28 2006`
	CROSSREFS	`Cf. A006530, A078898, A078897.` `Sequence in context: A029175 A056889 A039636 this_sequence A055172 A029334 A030273` `Adjacent sequences: A078896 A078897 A078898 this_sequence A078900 A078901 A078902`
	KEYWORD	`nonn`
	AUTHOR	`Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Dec 12 2002`

page 1

Search completed in 0.002 seconds

Last modified November 24 23:16 EST 2009. Contains 167481 sequences.

AT&T Labs Research