|
| |
|
|
A052369
|
|
Largest prime factor of n, where n runs through composite numbers.
|
|
22
| |
|
|
2, 3, 2, 3, 5, 3, 7, 5, 2, 3, 5, 7, 11, 3, 5, 13, 3, 7, 5, 2, 11, 17, 7, 3, 19, 13, 5, 7, 11, 5, 23, 3, 7, 5, 17, 13, 3, 11, 7, 19, 29, 5, 31, 7, 2, 13, 11, 17, 23, 7, 3, 37, 5, 19, 11, 13, 5, 3, 41, 7, 17, 43, 29, 11, 5, 13, 23, 31, 47, 19, 3, 7, 11, 5, 17, 13, 7, 53, 3, 11, 37, 7, 19, 23
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,1
|
|
|
EXAMPLE
| First composite is 4, largest prime factor is 2, so a(1)=2.
|
|
|
PROG
| (MAGMA) [ D[ #D]: n in [2..115] | not IsPrime(n) where D is PrimeDivisors(n) ]; [From Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), Jun 23 2009]
|
|
|
CROSSREFS
| a(n)=A006530(A002808(n)); A056608. [From Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Aug 25 2008]
Sequence in context: A174063 A124459 A046147 * A110976 A151570 A059036
Adjacent sequences: A052366 A052367 A052368 * A052370 A052371 A052372
|
|
|
KEYWORD
| nonn,easy
|
|
|
AUTHOR
| Michael Contente (mec1000(AT)aol.com), Mar 08 2000
|
|
|
EXTENSIONS
| More terms from James A. Sellers (sellersj(AT)math.psu.edu), Mar 09 2000
|
| |
|
|
