|
%I #27 Dec 09 2022 17:01:46
%S 0,1,1,2,3,5,2,13,3,7,2,17,5,11,89,2,3,233,13,29,2,5,61,3,7,47,1597,2,
%T 17,19,37,113,3,5,11,41,2,13,421,89,199,28657,2,3,7,23,5,3001,233,521,
%U 2,17,53,109,3,13,29,281,514229,2,5,11,31,61,557,2417,3,7,47,2207,2,89
%N Triangle T(n,k), n >= 0, in which n-th row (for n >= 3) lists prime factors of Fibonacci(n) (see A000045), without repetition.
%C Rows have irregular lengths.
%C T(n,k) = A027748(A000045(n),k), k = 1 .. A022307(n)). - _Reinhard Zumkeller_, Aug 30 2014
%H T. D. Noe and Charles R Greathouse IV, <a href="/A060442/b060442.txt">Rows n=0..1422 of triangle, flattened</a> (rows up to 1000 from Noe; using existing factorization databases)
%H J. Brillhart, P. L. Montgomery and R. D. Silverman, <a href="https://doi.org/10.1090/S0025-5718-1988-0917832-6">Tables of Fibonacci and Lucas factorizations</a>, Math. Comp. 50 (1988), 251-260, S1-S15. Math. Rev. 89h:11002.
%H Blair Kelly, <a href="http://mersennus.net/fibonacci//">Fibonacci and Lucas Factorizations</a>
%e Triangle begins:
%e 0;
%e 1;
%e 1;
%e 2;
%e 3;
%e 5;
%e 2;
%e 13;
%e 3, 7;
%e 2, 17;
%e 5, 11;
%e 89;
%e 2, 3;
%e 233;
%e 13, 29;
%e 2, 5, 61;
%e 3, 7, 47;
%e 1597;
%e 2, 17, 19;
%e 37, 113;
%e 3, 5, 11, 41;
%e ...
%p with(numtheory): with(combinat): for i from 3 to 50 do for j from 1 to nops(ifactors(fibonacci(i))[2]) do printf(`%d,`, ifactors(fibonacci(i))[2][j][1]) od: od:
%o (Haskell)
%o a060442 n k = a060442_tabf !! n !! k
%o a060442_row n = a060442_tabf !! n
%o a060442_tabf = [0] : [1] : [1] : map a027748_row (drop 3 a000045_list)
%o -- _Reinhard Zumkeller_, Aug 30 2014
%Y Cf. A000045, A060441.
%Y Cf. A027748, A022307 (row lengths for n>2), A001221.
%K nonn,tabf,easy
%O 0,4
%A _N. J. A. Sloane_, Apr 07 2001
%E More terms from _James A. Sellers_, Apr 09 2001
|
