id:A056582 - OEIS Search Results

Search: id:A056582

Displaying 1-1 of 1 results found.

page 1

Highest common factor (or GCD) of n^n and hyperfactorial[n-1], i.e. GCD[n^n, product(k^k) for k<n].

+0
3

1, 1, 4, 1, 1728, 1, 65536, 19683, 3200000, 1, 8916100448256, 1, 13492928512, 437893890380859375, 18446744073709551616, 1, 39346408075296537575424, 1, 104857600000000000000000000 (list; graph; listen)

	OFFSET	`2,3`
	COMMENT	`Sequence could be defined as: a(2) = 1, a(4) = 4, a(8) = 65536, a(9) = 19683; if p an odd prime: a(p) = 1 and a(2p) = (4p)^p; otherwise if n>1: a(n) = n^n.`
	FORMULA	`a(n) = GCD[A000312(n), A002109(n-1)]. Except for n = 4, a(n) = A056583(n)^A056584(n) = A056583(n)^(n^2/A056583(n)) = (n^2/A056584(n))^A056584(n).`
	EXAMPLE	`a(6) = GCD(46656,86400000) = 1728`
	CROSSREFS	`Sequence in context: A038019 A164804 A036115 this_sequence A105087 A028572 A107492` `Adjacent sequences: A056579 A056580 A056581 this_sequence A056583 A056584 A056585`
	KEYWORD	`nonn`
	AUTHOR	`Henry Bottomley (se16(AT)btinternet.com), Jul 03 2000`

page 1

Search completed in 0.002 seconds

Last modified December 15 00:47 EST 2009. Contains 170825 sequences.

AT&T Labs Research