login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A063047 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
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; refs; listen; history; internal format)
OFFSET

1,1

COMMENTS

Prime powers (p^k, k = nonnegative integer) raised to a power are never mutinous.

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 * A003270 A099054 A071282

Adjacent sequences:  A063044 A063045 A063046 * A063048 A063049 A063050

KEYWORD

nonn

AUTHOR

Leroy Quet Aug 03 2001

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 00:09 EST 2012. Contains 205978 sequences.