id:A072751 - OEIS Search Results

Search: id:A072751

Displaying 1-1 of 1 results found.

page 1

Greatest of the most frequent prime factors of square-free numbers <= n; a(1)=1.

+0
5

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

	OFFSET	`1,2`
	COMMENT	`a(n)=2 for n>14.`
	CROSSREFS	`Cf. A005117, A072747, A072748, A072749, A072750.` `Adjacent sequences: A072748 A072749 A072750 this_sequence A072752 A072753 A072754` `Sequence in context: A113195 A069110 A123221 this_sequence A131971 A100742 A001269`
	KEYWORD	`nonn,nice`
	AUTHOR	`Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Jul 08 2002`

page 1

Search completed in 0.002 seconds

Last modified October 13 20:18 EDT 2008. Contains 145016 sequences.

AT&T Labs Research