|
Search: id:A062065
|
|
|
| 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). |
|
+0
3
|
|
| 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; listen)
|
|
|
OFFSET
|
1,2
|
|
|
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.
|
|
PROGRAM
|
(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<m, y1=concat(w1, q); y2=concat(w2, news(w1, q)); y3=concat(w3, news(w2, q)); if(unique(vecsort(concat(concat(y1, y2), y3))), w1=y1; w2=y2; w3=y3; print1(q, ", ")); q=q+1)}
|
|
CROSSREFS
|
Cf. A036241, A051912.
Sequence in context: A005682 A114833 A065617 this_sequence A008936 A073769 A008937
Adjacent sequences: A062062 A062063 A062064 this_sequence A062066 A062067 A062068
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Olivier Gerard (ogerard(AT)ext.jussieu.fr), Jun 26 2001
|
|
EXTENSIONS
|
More terms from Naohiro Nomoto (n_nomoto(AT)yabumi.com), Oct 07 2001
Terms a(27) to a(41) and PARI code from Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), May 17 2003
|
|
|
Search completed in 0.003 seconds
|
