prime Hyperfibonacci numbers

[Lallouet]

I propose you a modest participation to your problem.

I have calculated all the the terms of iterated partial sums of Fibonacci numbers and extracted the primes < 10^6 (the maximum I can do) , with the following results:

For n>29, no prime < 10^6

For n=3, 220 primes <10^6 (list joined, excel format))

For 3<n<=29, besides the terms cited in your message only 3 primes <10^6 : 6763 (k=6, n=12)  59281 (k=7 , n=19) 80979 (k=7 n=20)

In the limit of 10^6, most sequences for any given k are void in primes

Best regards

Philippe LALLOUET
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://list.seqfan.eu/pipermail/seqfan/attachments/20080406/a6210391/attachment-0001.htm>
-------------- next part --------------
A non-text attachment was scrubbed...
Name: HyperFibonacci primes.xlsx
Type: application/vnd.openxmlformats-officedocument.spreadsheetml.sheet
Size: 14976 bytes
Desc: not available
URL: <http://list.seqfan.eu/pipermail/seqfan/attachments/20080406/a6210391/attachment-0001.xlsx>