|
| |
|
|
A056608
|
|
Smallest divisor of n as n runs through composite numbers.
|
|
23
| |
|
|
2, 2, 2, 3, 2, 2, 2, 3, 2, 2, 2, 3, 2, 2, 5, 2, 3, 2, 2, 2, 3, 2, 5, 2, 2, 3, 2, 2, 2, 3, 2, 2, 7, 2, 3, 2, 2, 5, 2, 3, 2, 2, 2, 3, 2, 5, 2, 2, 3, 2, 2, 2, 3, 2, 7, 2, 2, 3, 2, 2, 5, 2, 3, 2, 2, 7, 2, 3, 2, 5, 2, 2, 3, 2, 2, 2, 3, 2, 2, 2, 3, 2, 2, 5, 2, 3, 2, 7, 2, 11, 2, 3, 2, 5, 2, 2, 3, 2, 2, 7, 2, 3, 2, 2, 2
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,1
|
|
|
PROG
| (MAGMA) [ PrimeDivisors(n)[1]: n in [2..140] | not IsPrime(n) ]; [From Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), Jun 23 2009]
|
|
|
CROSSREFS
| Cf. A052369 (largest prime factor of n, where n runs through composite numbers). [From Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), Jun 23 2009]
Sequence in context: A160764 A156384 A064656 * A091787 A087040 A065569
Adjacent sequences: A056605 A056606 A056607 * A056609 A056610 A056611
|
|
|
KEYWORD
| easy,nonn
|
|
|
AUTHOR
| Odimar Fabeny (fabeny(AT)terra.com.br), Aug 07 2000
|
|
|
EXTENSIONS
| More terms from James A. Sellers (sellersj(AT)math.psu.edu), Aug 25 2000
|
| |
|
|
