id:A054576 - OEIS Search Results

Search: id:A054576

Displaying 1-1 of 1 results found.

page 1

Largest proper factor of largest proper factor of n.

+0
9

1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 3, 1, 1, 1, 4, 1, 3, 1, 5, 1, 1, 1, 6, 1, 1, 3, 7, 1, 5, 1, 8, 1, 1, 1, 9, 1, 1, 1, 10, 1, 7, 1, 11, 5, 1, 1, 12, 1, 5, 1, 13, 1, 9, 1, 14, 1, 1, 1, 15, 1, 1, 7, 16, 1, 11, 1, 17, 1, 7, 1, 18, 1, 1, 5, 19, 1, 13, 1, 20, 9, 1, 1, 21, 1, 1, 1, 22, 1, 15, 1, 23, 1, 1, 1, 24 (list; graph; listen)

	OFFSET	`1,8`
	FORMULA	`a(n) = A053598(A053598(n))` `a(n)=A032742(A032742(n)); A117357(n)=A020639(a(n)); A117358(n)=A032742(a(n))=a(n)/A117357(n); a(A037143(n))=1, a(A033942(n))>1. - Reinhard Zumkeller (reinhard.zumkeller(AT)lhsystems.com), Mar 10 2006`
	CROSSREFS	`Cf. A053598.` `Sequence in context: A115622 A108886 A001492 this_sequence A138904 A135222 A124094` `Adjacent sequences: A054573 A054574 A054575 this_sequence A054577 A054578 A054579`
	KEYWORD	`easy,nonn`
	AUTHOR	`Henry Bottomley (se16(AT)btinternet.com), Apr 11 2000`

page 1

Search completed in 0.002 seconds

Last modified August 29 17:54 EDT 2008. Contains 143238 sequences.

AT&T Labs Research