login
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.
4
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, 23, 51, 31, 22, 43, 34, 48, 44, 28, 36, 19, 29, 42, 81, 68, 33, 35, 69, 60, 72, 63, 73, 52, 56, 40, 105, 61, 70, 84, 93, 91, 82, 50, 41, 98, 45, 53, 103, 64, 78, 54, 123, 128, 57, 71, 129
OFFSET
1,2
COMMENTS
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).
LINKS
Rémy Sigrist, Table of n, a(n) for n = 1..50000 (first 1000 terms from N. J. A. Sloane)
PROG
(C++) See Links section.
CROSSREFS
Cf. A014190, A329544, A330312, A330314 (running totals).
Sequence in context: A065014 A013945 A072656 * A191669 A344891 A163841
KEYWORD
nonn,look,base
AUTHOR
N. J. A. Sloane, Dec 11 2019
STATUS
approved