|
Search: id:A060441
|
|
|
| A060441 |
|
Triangle T(n,k), n >= 0, in which n-th row (for n >= 3) lists prime factors of Fibonacci(n) (see A000045), with repetition. |
|
+0
3
|
|
| 0, 1, 1, 2, 3, 5, 2, 2, 2, 13, 3, 7, 2, 17, 5, 11, 89, 2, 2, 2, 2, 3, 3, 233, 13, 29, 2, 5, 61, 3, 7, 47, 1597, 2, 2, 2, 17, 19, 37, 113, 3, 5, 11, 41, 2, 13, 421, 89, 199, 28657, 2, 2, 2, 2, 2, 3, 3, 7, 23, 5, 5, 3001, 233, 521, 2, 17, 53, 109, 3, 13, 29, 281, 514229, 2, 2, 2, 5, 11, 31, 61
(list; graph; listen)
|
|
|
OFFSET
|
0,4
|
|
|
COMMENT
|
Rows have irregular lengths.
|
|
EXAMPLE
|
0; 1; 1; 2; 3; 5; 2,2,2; 13; 3,7; 2,17; ...
|
|
MAPLE
|
with(combinat); A060441 := n->ifactor(fibonacci(n));
with(numtheory): with(combinat): for i from 3 to 50 do for j from 1 to nops(ifactors(fibonacci(i))[2]) do for k from 1 to ifactors(fibonacci(i))[2][j][2] do printf(`%d, `, ifactors(fibonacci(i))[2][j][1]) od: od: od:
|
|
CROSSREFS
|
A000045, A060442.
Adjacent sequences: A060438 A060439 A060440 this_sequence A060442 A060443 A060444
Sequence in context: A094122 A082117 A011157 this_sequence A065996 A133906 A133907
|
|
KEYWORD
|
nonn,tabf,easy
|
|
AUTHOR
|
njas, Apr 07 2001
|
|
EXTENSIONS
|
More terms from James A. Sellers (sellersj(AT)math.psu.edu), Apr 09 2001
|
|
|
Search completed in 0.002 seconds
|
