|
Search: id:A140102
|
|
| |
|
| 1, 2, 4, 5, 6, 7, 9, 10, 11, 13, 14, 15, 16, 18, 19, 21, 22, 23, 24, 26, 27, 28, 30, 31, 32, 33, 35, 36, 37, 38, 40, 41, 42, 44, 45, 46, 47, 49, 50, 52, 53, 54, 55, 57, 58, 59, 61, 62, 63, 64, 66, 67, 68, 70, 71, 72, 73, 75, 76, 78, 79, 80, 81, 83, 84, 85, 87, 88, 89, 90, 92, 93
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
LINKS
|
Reinhard Zumkeller, Table of n, a(n) for n=1..1001
|
|
FORMULA
|
a(n) = A140101(n) - A140100(n).
Conjecture: the limit of A140103(n)/A140102(n) = t^2 = 3.38297576...
where the limit of A140101(n)/A140100(n) = t = 1.839286755...
and t = tribonacci constant satisfies: t^3 = 1 + t + t^2.
|
|
PROGRAM
|
(PARI) {X=[1]; Y=[2]; D=[1]; S=[3]; print1(Y[1]-X[1]", "); for(n=1, 100, for(j=2, 2*n, if(setsearch(Set(concat(X, Y)), j)==0, Xt=concat(X, j); for(k=j+1, 3*n, if(setsearch(Set(concat(Xt, Y)), k)==0, if(setsearch(Set(concat(D, S)), k-j)==0, if(setsearch(Set(concat(D, S)), k+j)==0, X=Xt; Y=concat(Y, k); D=concat(D, k-j); S=concat(S, k+j); print1(Y[ #X]-X[ #Y]", "); break); break))))))}
|
|
CROSSREFS
|
Cf. A140103 (complement); A140100, A140101; A058265.
Sequence in context: A024616 A023733 A039101 this_sequence A084437 A037083 A039052
Adjacent sequences: A140099 A140100 A140101 this_sequence A140103 A140104 A140105
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Paul D. Hanna (pauldhanna(AT)juno.com), Jun 04 2008
|
|
EXTENSIONS
|
Terms computed by Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com).
|
|
|
Search completed in 0.002 seconds
|
