cp's OEIS Frontend

A330313 Add the odd terms and subtract the even ones, the result must always be a palindrome in base 3. This is the lexicographically earliest sequence of distinct positive integers with this property.

%I A330313 #21 Dec 11 2019 16:41:43
%S A330313 1,3,2,11,7,4,6,8,21,5,12,14,89,9,18,26,16,20,10,13,17,24,75,39,30,32,
%T A330313 23,51,31,22,43,34,48,44,28,36,19,29,42,81,68,33,35,69,60,72,63,73,52,
%U A330313 56,40,105,61,70,84,93,91,82,50,41,98,45,53,103,64,78,54,123,128,57,71,129
%N A330313 Add the odd terms and subtract the even ones, the result must always be a palindrome in base 3. This is the lexicographically earliest sequence of distinct positive integers with this property.
%C A330313 A base 3 analog of A329544. The latter has an exceptionally irregular graph, so it is natural to ask if the graph is more understandable in a smaller base (and base 2 does not work).
%H A330313 Rémy Sigrist, <a href="/A330313/b330313.txt">Table of n, a(n) for n = 1..50000</a> (first 1000 terms from N. J. A. Sloane)
%H A330313 Rémy Sigrist, <a href="/A330313/a330313.png">Density plot of the first 5000000 terms</a>
%H A330313 Rémy Sigrist, <a href="/A330313/a330313_1.txt">C++ program for A330313</a>
%H A330313 N. J. A. Sloane, <a href="/A330313/a330313.txt">Table of n, a(n), A330314(n), A330314(n)/a(n) for n = 1..1000</a>
%o A330313 (C++) See Links section.
%Y A330313 Cf. A014190, A329544, A330312, A330314 (running totals).
%K A330313 nonn,look,base
%O A330313 1,2
%A A330313 _N. J. A. Sloane_, Dec 11 2019