|
| |
|
|
A115074
|
|
a(n) = largest prime dividing n-th non-squarefree positive integer.
|
|
2
| |
|
|
2, 2, 3, 3, 2, 3, 5, 3, 5, 3, 7, 2, 3, 5, 11, 5, 3, 7, 5, 13, 3, 7, 5, 7, 2, 17, 3, 5, 19, 5, 3, 7, 11, 5, 23, 3, 7, 11, 5, 13, 3, 7, 29, 13, 5, 11, 31, 5, 7, 2, 11, 5, 17, 7, 3, 7, 37, 5, 19, 17, 13, 5, 3, 41, 7, 13, 19, 43, 7, 11, 5, 23, 47, 7, 3, 7, 11, 5, 17, 23, 13, 53, 3, 11, 7, 5, 19, 29, 13
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,1
|
|
|
FORMULA
| A006530(A013929(n))
|
|
|
EXAMPLE
| 12, the 4th non-squarefree positive integer, is 2^2 * 3. 3 is the largest prime dividing 12. So a(4) = 3.
|
|
|
MAPLE
| with(numtheory): a:=proc(n) if mobius(n)=0 then op(nops(factorset(n)), factorset(n)) fi end: seq(a(n), n=1..270); - Emeric Deutsch (deutsch(AT)duke.poly.edu), Mar 06 2006
|
|
|
MATHEMATICA
| Needs["NumberTheory`NumberTheoryFunctions`"]; FactorInteger[ # ][[ -1, 1]] & /@ Select[ Range@235, !SquareFreeQ@# &] - Robert G. Wilson v (rgwv(at)rgwv.com), Mar 09 2006
|
|
|
CROSSREFS
| Cf. A117183, A115090, A013929, A006530.
Sequence in context: A179751 A039645 A048687 * A039643 A154258 A167618
Adjacent sequences: A115071 A115072 A115073 * A115075 A115076 A115077
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Leroy Quet Mar 01 2006
|
|
|
EXTENSIONS
| More terms from Emeric Deutsch (deutsch(AT)duke.poly.edu) and Robert G. Wilson v (rgwv(at)rgwv.com), Mar 06 2006
|
| |
|
|
