|
|
A027748
|
|
Irregular triangle in which first row is 1, n-th row (n > 1) lists distinct prime factors of n.
|
|
226
|
|
|
1, 2, 3, 2, 5, 2, 3, 7, 2, 3, 2, 5, 11, 2, 3, 13, 2, 7, 3, 5, 2, 17, 2, 3, 19, 2, 5, 3, 7, 2, 11, 23, 2, 3, 5, 2, 13, 3, 2, 7, 29, 2, 3, 5, 31, 2, 3, 11, 2, 17, 5, 7, 2, 3, 37, 2, 19, 3, 13, 2, 5, 41, 2, 3, 7, 43, 2, 11, 3, 5, 2, 23, 47, 2, 3, 7, 2, 5, 3, 17, 2, 13, 53, 2, 3, 5, 11, 2, 7, 3, 19, 2, 29, 59, 2, 3, 5, 61, 2, 31
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
Number of terms in n-th row is A001221(n) for n > 1.
(End)
|
|
LINKS
|
|
|
EXAMPLE
|
Triangle begins:
1;
2;
3;
2;
5;
2, 3;
7;
2;
3;
2, 5;
11;
2, 3;
13;
2, 7;
...
|
|
MAPLE
|
with(numtheory): [ seq(factorset(n), n=1..100) ];
|
|
MATHEMATICA
|
|
|
PROG
|
(Haskell)
import Data.List (unfoldr)
a027748 n k = a027748_tabl !! (n-1) !! (k-1)
a027748_tabl = map a027748_row [1..]
a027748_row 1 = [1]
a027748_row n = unfoldr fact n where
fact 1 = Nothing
fact x = Just (p, until ((> 0) . (`mod` p)) (`div` p) x)
where p = a020639 x -- smallest prime factor of x
(PARI) print1(1); for(n=2, 20, f=factor(n)[, 1]; for(i=1, #f, print1(", "f[i]))) \\ Charles R Greathouse IV, Mar 20 2013
(Python)
from sympy import primefactors
for n in range(2, 101):
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy,tabf,nice
|
|
AUTHOR
|
|
|
EXTENSIONS
|
More terms from Scott Lindhurst (ScottL(AT)alumni.princeton.edu)
|
|
STATUS
|
approved
|
|
|
|