This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A062065 a(1) = 1; for n >= 1, a(n+1) is smallest number such that the sums of any one, two or three of a(1), ..., a(n) are distinct (repetitions not allowed). 2
 1, 2, 4, 8, 15, 28, 52, 96, 165, 278, 460, 663, 980, 1332, 1864, 2609, 3375, 4769, 5600, 6776, 9141, 11505, 14453, 17404, 21904, 25023, 31159, 35006, 42780, 51792, 55799, 68834, 75036, 87163, 96746, 116231, 128924, 144085, 172606, 193507, 207826 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS EXAMPLE 1,2,1+2 are different so a(2) = 2; 1,2,3,1+2,1+3,2+3,1+2+3 are not all different (3 = 1+2) so a(3) is not 3; 1,2,4,1+2,1+4,2+4,1+2+4 are all different so a(3) = 4. PROG (PARI) {unique(v)=local(b); b=1; for(j=2, length(v), if(v[j-1]==v[j], b=0)); b} (PARI) {news(v, q)=local(s); s=[]; for(i=1, length(v), s=concat(s, v[i]+q)); s} (PARI) {m=210000; print1(p=1, ", "); w1=[p]; w2=[]; w3=[]; q=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 July 17 02:10 EDT 2019. Contains 325092 sequences. (Running on oeis4.)