Loading ...
Sorry, an error occurred while loading the content.

Re: Hey factorers... a sequence of numbers that are never prime

Expand Messages
  • djbroadhurst
    ... F(n)=fibonacci(n); L(n)=if(n,F(2*n)/F(n),2); A(n)=if(n%2,L(n)^2,5*F(n)^2); print(vector(15,n,A(n))); [1, 5, 16, 45, 121, 320, 841, 2205, 5776, 15125,
    Message 1 of 4 , Mar 31, 2013
    • 0 Attachment
      --- In primenumbers@yahoogroups.com,
      "WarrenS" <warren.wds@...> wrote:

      > http://oeis.org/A004146

      F(n)=fibonacci(n);
      L(n)=if(n,F(2*n)/F(n),2);
      A(n)=if(n%2,L(n)^2,5*F(n)^2);
      print(vector(15,n,A(n)));

      [1, 5, 16, 45, 121, 320, 841, 2205, 5776, 15125, 39601, 103680, 271441, 710645, 1860496]

      David
    • djbroadhurst
      ... http://mersennus.net/fibonacci/ provides complete factorizations of A(n) for 0
      Message 2 of 4 , Mar 31, 2013
      • 0 Attachment
        --- In primenumbers@yahoogroups.com,
        "djbroadhurst" <d.broadhurst@...> wrote:

        > F(n)=fibonacci(n);
        > L(n)=if(n,F(2*n)/F(n),2);
        > A(n)=if(n%2,L(n)^2,5*F(n)^2);

        http://mersennus.net/fibonacci/
        provides complete factorizations of A(n) for 0 < n < 1159:
        http://mersennus.net/fibonacci/lucholes.txt

        David
      Your message has been successfully submitted and would be delivered to recipients shortly.