login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A175211 The finite sequence with the largest possible number of terms such that a(1) = a(2) = 1, for n >= 3, a(n) = prime p such that p = Sum_{i=1...k} a(n-i) for any k. 0

%I #2 Mar 30 2012 19:00:23

%S 1,1,2,3,7,13,23,43,89,181,349,619,1327,2657,4603

%N The finite sequence with the largest possible number of terms such that a(1) = a(2) = 1, for n >= 3, a(n) = prime p such that p = Sum_{i=1...k} a(n-i) for any k.

%C There are like shorter finite sequences with different terms: (1,1,2,3,5,11,19,41,71,131,281), (1,1,2,3,5,11,19,41,71,131,283), (1,1,2,3,5,11,19,41,79,139), (1,1,2,3,5,11,19,41,83), (1,1,2,3,5,11,23), (1,1,2,3,7,13,23,43,79), (1,1,2,3,7,13,23,43,89,181,313), (1,1,2,3,7,13,23,43,89,181,359).

%e For n=15: a(15)=4603=a(14)+a(13)+a(12)=2657+1327+619, 4603=prime.

%K nonn

%O 1,3

%A _Jaroslav Krizek_, Mar 05 2010

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 19 14:10 EDT 2024. Contains 371792 sequences. (Running on oeis4.)