The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A060276 a(1) = 2; a(n) = smallest prime > a(n-1) such that the sum of any three nondecreasing terms, chosen from a(1), ..., a(n-1) and a(n), is unique. 1
 2, 3, 7, 19, 59, 73, 211, 257, 631, 919, 1291, 1979, 3229, 4397, 5557, 7151, 10657, 12049, 17827, 19577, 25919, 32143, 35951, 46141, 54499, 64433, 81199, 92507, 116009, 132511, 145303, 171763, 193679, 232417, 260549, 289573, 302009 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS EXAMPLE For {2,3,5} the sums are not unique: 2+2+5 = 3+3+3. Three terms chosen from {2,3,7} can be 2+2+2; 2+2+3; 2+3+3; 3+3+3; 2+2+7; 2+3+7; 3+3+7; 2+7+7; 3+7+7; 7+7+7; the sums are all distinct, so a(3) = 7. PROG (PARI) {unique(v)=local(b); b=1; for(j=2, length(v), if(v[j-1]==v[j], b=0)); b} {news(v, q)=local(s); s=[]; for(i=1, length(v), s=concat(s, v[i]+q)); s} {m=310000; print1(p=2, ", "); w1=[p]; w2=[p+p]; w3=[p+p+p]; q=nextprime(p+1); while(q

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

Last modified April 8 14:52 EDT 2020. Contains 333314 sequences. (Running on oeis4.)