id:A063047 - OEIS Search Results

Search: id:A063047

Displaying 1-1 of 1 results found.

page 1

Minimum n where (c_m)^n is mutinous (i.e. part of sequence A027854), where c_m is the m-th positive integer not a prime power.

+0
1

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

	OFFSET	`1,1`
	COMMENT	`Prime powers (p^k, k = nonnegative integer) raised to a power are never mutinous.`
	LINKS	`Leroy Quet, Home Page (listed in lieu of email address)`
	FORMULA	`n = ceiling[ln(p)/(ln(c_m) - k ln(p))], where p is largest prime to divide c_m and p^k is the highest power of p to divide c_m.`
	EXAMPLE	`a(1) = 2 because the first non-prime-power is 6; and 6^2 = 36, but not 6^1, is mutinous.`
	CROSSREFS	`A027854 A024619.` `Sequence in context: A135511 A007413 A072457 this_sequence A003270 A099054 A071282` `Adjacent sequences: A063044 A063045 A063046 this_sequence A063048 A063049 A063050`
	KEYWORD	`nonn`
	AUTHOR	`Leroy Quet Aug 03 2001`

page 1

Search completed in 0.002 seconds

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

AT&T Labs Research