id:A056813 - OEIS Search Results

Search: id:A056813

Displaying 1-1 of 1 results found.

page 1

Largest non-unitary prime factor of LCM[1,...,n]; i.e. the largest prime which occurs to power > 1 in prime factorization of LCM[1,..,n].

+0
1

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

	OFFSET	`0,4`
	COMMENT	`For n>0, p(n) appears {(p(n+1))^2 - (p(n))^2} times [from n=(p(n))^2 to n=(p(n+1))^2 - 1], i.e., A000040(n) appears A069482(n) times[from n=A001248(n) to n=A084920(n+1)] - Lekraj Beedassy (blekraj(AT)yahoo.com), Mar 31 2005` `a(n) is the largest prime factor of A045948(n). [From Matthew Vandermast (ghodges14(AT)comcast.net), Oct 29 2008]`
	FORMULA	`a(n)=p(w) if p(w)^2 <= n < p(w+1)^2.`
	EXAMPLE	`The j-th prime appears at the position of its square, at n=P(j)^2.`
	CROSSREFS	`Cf. A054041, A056170.` `Sequence in context: A006374 A064876 A105517 this_sequence A125269 A077430 A105513` `Adjacent sequences: A056810 A056811 A056812 this_sequence A056814 A056815 A056816`
	KEYWORD	`nonn`
	AUTHOR	`Labos E. (labos(AT)ana.sote.hu), Aug 28 2000`

page 1

Search completed in 0.002 seconds

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

AT&T Labs Research