|
| |
|
|
A035306
|
|
List prime factors of each number in order (each prime factor is followed by its power). Start with 1={1,1}.
|
|
0
| |
|
|
1, 1, 2, 1, 3, 1, 2, 2, 5, 1, 2, 1, 3, 1, 7, 1, 2, 3, 3, 2, 2, 1, 5, 1, 11, 1, 2, 2, 3, 1, 13, 1, 2, 1, 7, 1, 3, 1, 5, 1, 2, 4, 17, 1, 2, 1, 3, 2, 19, 1, 2, 2, 5, 1, 3, 1, 7, 1, 2, 1, 11, 1, 23, 1, 2, 3, 3, 1, 5, 2, 2, 1, 13, 1, 3, 3, 2, 2, 7, 1, 29, 1, 2, 1, 3, 1, 5, 1, 31, 1, 2, 5, 3, 1, 11, 1, 2
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,3
|
|
|
COMMENTS
| This entry also serves to show how to factor numbers in various languages.
Memo: in Maple, use ifactors, not ifactor!
|
|
|
EXAMPLE
| 1={1,1}, 2={2,1}, 3={3,1}, 4={2,2}, 5={5,1}, 6={2,1,3,1}, ...
|
|
|
MAPLE
| for n from 2 to 256 do lprint(op(2..-1, ifactors(n))); od:
|
|
|
MATHEMATICA
| Flatten[ Array[ FactorInteger[ # ]&, 40 ] ]
|
|
|
PROG
| (MAGMA) [ Factorization(n) : n in [1..120]];
(PARI) for (n=2, 256, print(factor(n))) [There has to be a better PARI code than this]
|
|
|
CROSSREFS
| Sequence in context: A029331 A037269 A124579 * A101691 A205379 A070094
Adjacent sequences: A035303 A035304 A035305 * A035307 A035308 A035309
|
|
|
KEYWORD
| nonn,tabf
|
|
|
AUTHOR
| N. J. A. Sloane (njas(AT)research.att.com).
|
| |
|
|
