|
| |
|
|
A062090
|
|
a(1) = 1, a(n)= smallest odd number which does not divide the product of all previous terms.
|
|
8
| |
|
|
1, 3, 5, 7, 9, 11, 13, 17, 19, 23, 25, 29, 31, 37, 41, 43, 47, 49, 53, 59, 61, 67, 71, 73, 79, 81, 83, 89, 97, 101, 103, 107, 109, 113, 121, 127, 131, 137, 139, 149, 151, 157, 163, 167, 169, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 289, 293, 307, 311, 313, 317, 331, 337, 347, 349, 353, 359, 361, 367, 373, 379, 383, 389, 397, 401, 409, 419, 421, 431, 433, 439, 443, 449, 457, 461, 463, 467, 479, 487, 491, 499, 503, 509, 521, 523, 529, 541, 547, 557, 563, 569, 571, 577, 587, 593, 599, 601, 607, 613, 617, 619, 625, 631, 641, 643, 647, 653, 659, 661, 673, 677, 683, 691, 701, 709, 719, 727, 733, 739, 743, 751, 757, 761, 769, 773, 787
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,2
|
|
|
COMMENTS
| In A050150 but not here: [729, 15625, 59049, 117649, 531441]; here but not in A050150: [1, 6561, 390625]. - Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), Nov 01, 2001
|
|
|
LINKS
| T. D. Noe, Table of n, a(n) for n=1..1000
|
|
|
FORMULA
| Numbers of the form p^(2^k) where p is an odd prime and k is a nonnegative integer.
|
|
|
EXAMPLE
| After 13 the next term is 17 (not 15) as 15 = 3*5 divides the product of all the previous terms.
|
|
|
MATHEMATICA
| a = {1}; Do[b = Apply[ Times, a]; k = 1; While[ IntegerQ[b/k], k += 2]; a = Append[a, k], { n, 2, 60} ]; a
|
|
|
CROSSREFS
| Cf. A026477, A062091, A050150 (a different sequence).
Sequence in context: A061345 A080429 A050150 * A172095 A133854 A030155
Adjacent sequences: A062087 A062088 A062089 * A062091 A062092 A062093
|
|
|
KEYWORD
| nonn,easy,nice
|
|
|
AUTHOR
| Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Jun 16 2001
|
|
|
EXTENSIONS
| Corrected and extended by Dean Hickerson (dean.hickerson(AT)yahoo.com), Jul 10, 2001
|
| |
|
|
