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
1, 1, 2, 3, 7, 13, 23, 43, 89, 181, 349, 619, 1327, 2657, 4603 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
COMMENTS
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).
LINKS
EXAMPLE
For n=15: a(15)=4603=a(14)+a(13)+a(12)=2657+1327+619, 4603=prime.
CROSSREFS
Sequence in context: A271827 A298339 A091440 * A330028 A075058 A213968
KEYWORD
nonn
AUTHOR
Jaroslav Krizek, Mar 05 2010
STATUS
approved

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 24 00:30 EDT 2024. Contains 371917 sequences. (Running on oeis4.)