|
%I #20 Apr 25 2021 13:11:58
%S 2,5,9,3,6,14,5,9,20,27,10,35,4,6,13,21,44,8,26,54,14,20,65,17,24,77,
%T 9,44,90,5,11,14,18,33,51,104,21,38,119,135,12,22,49,75,152,14,25,55,
%U 84,170,35,45,189,6,11,26,39,50,68,209,9,15,29,35,75,114,230,17,252
%N Make a list of triples [n,k,m] with n>=1, k>=1, and T_n+T_k = T_m as in A309507, arranged in lexicographic order; sequence gives values of k.
%H J. S. Myers, R. Schroeppel, S. R. Shannon, N. J. A. Sloane, and P. Zimmermann, <a href="http://arxiv.org/abs/2004.14000">Three Cousins of Recaman's Sequence</a>, arXiv:2004:14000 [math.NT], April 2020.
%e The first few triples are:
%e 2, 2, 3
%e 3, 5, 6
%e 4, 9, 10
%e 5, 3, 6
%e 5, 6, 8
%e 5, 14, 15
%e 6, 5, 8
%e 6, 9, 11
%e 6, 20, 21
%e 7, 27, 28
%e 8, 10, 13
%e 8, 35, 36
%e 9, 4, 10
%e 9, 6, 11
%e 9, 13, 16
%e 9, 21, 23
%e 9, 44, 45
%e 10, 8, 13
%e 10, 26, 28
%e 10, 54, 55
%e 11, 14, 18
%e 11, 20, 23
%e 11, 65, 66
%e 12, 17, 21
%e 12, 24, 27
%e 12, 77, 78
%e ...
%p # This program produces the triples for each value of n, but then they need to be sorted on k:
%p with(numtheory):
%p A:=[]; M:=100;
%p for n from 1 to M do
%p TT:=n*(n+1);
%p dlis:=divisors(TT);
%p for d in dlis do
%p if (d mod 2) = 1 then e := TT/d;
%p mi:=min(d,e); ma:=max(d,e);
%p k:=(ma-mi-1)/2;
%p m:=(ma+mi-1)/2;
%p # skip if k=0
%p if k>0 then
%p lprint(n,k,m);
%p fi;
%p fi;
%p od:
%p od:
%Y Cf. A000217, A309507, A333529, A333531.
%Y If we only take triples [n,k,m] with n <= k <= m, the values of k and m are A198455 and A198456 respectively.
%K nonn
%O 1,1
%A _N. J. A. Sloane_, Apr 01 2020
|
