|
Search: id:A134193
|
|
|
| A134193 |
|
a(1) = 1; for n>1, a(n) = the smallest positive integer not occurring among the exponents in the prime-factorization of n. |
|
+0
1
|
|
| 1, 2, 2, 1, 2, 2, 2, 1, 1, 2, 2, 3, 2, 2, 2, 1, 2, 3, 2, 3, 2, 2, 2, 2, 1, 2, 1, 3, 2, 2, 2, 1, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 2, 3, 3, 2, 2, 2, 1, 3, 2, 3, 2, 2, 2, 2, 2, 2, 2, 3, 2, 2, 3, 1, 2, 2, 2, 3, 2, 2, 2, 1, 2, 2, 3, 3, 2, 2, 2, 2, 1, 2, 2, 3, 2, 2, 2, 2, 2, 3, 2, 3, 2, 2, 2, 2, 2, 3, 3, 1, 2, 2, 2, 2, 2, 2
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
EXAMPLE
|
The prime factorization of 24 is 2^3 * 3^1. The exponents are 3 and 1. Therefore a(24) = 2 is the smallest positive integer not occurring among (3,1).
|
|
MATHEMATICA
|
Table[Complement[Range[n], Table[FactorInteger[n][[i, 2]], {i, 1, Length[FactorInteger[n]]}]][[1]], {n, 2, 120}] - Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), Jan 21 2008
|
|
CROSSREFS
|
Adjacent sequences: A134190 A134191 A134192 this_sequence A134194 A134195 A134196
Sequence in context: A072463 A128853 A136165 this_sequence A085030 A078377 A105697
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Leroy Quet (qq-quet(AT)mindspring.com), Jan 13 2008
|
|
EXTENSIONS
|
More terms from Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), Jan 21 2008
|
|
|
Search completed in 0.002 seconds
|
