Anonymous user
Fibonacci n-step number sequences: Difference between revisions
→{{header|PARI/GP}}: Tagged incorrect as a requirement is to generate sequence from initial terms, also no Lucas series shown.
(GP) |
(→{{header|PARI/GP}}: Tagged incorrect as a requirement is to generate sequence from initial terms, also no Lucas series shown.) |
||
Line 375:
=={{header|PARI/GP}}==
{{incorrect|PARI/GP|Requirement is to generate sequence from initial terms rather than 'n', also no Lucas series shown.}}
The function <code>gen</code> generates code to generate a given number of terms of the k-th sequence. Of course there are other approaches.
<lang parigp>gen(n)=k->my(v=vector(k,i,1));for(i=3,min(k,n),v[i]=2^(i-2));for(i=n+1,k,v[i]=sum(j=i-n,i-1,v[j]));v
| |||