A276624 -id:A276624 - cp's OEIS frontend

A276623 The infinite trunk of ternary beanstalk: The only infinite sequence such that a(n-1) = a(n) - A053735(a(n)), where A053735(n) = base-3 digit sum of n.

0, 2, 4, 8, 10, 12, 16, 20, 26, 28, 30, 34, 38, 42, 46, 52, 56, 62, 68, 72, 80, 82, 84, 88, 92, 96, 100, 106, 110, 116, 122, 126, 134, 140, 144, 152, 160, 164, 170, 176, 180, 188, 194, 198, 204, 212, 216, 224, 232, 242, 244, 246, 250, 254, 258, 262, 268, 272, 278, 284, 288, 296, 302, 306, 314, 322, 326, 332, 338, 342, 350, 356, 360

Offset: 0

Antti Karttunen, Sep 11 2016

Antti Karttunen, Table of n, a(n) for n = 0..6250

Cf. A004128, A024023, A053735, A054861, A261231 (left inverse), A261233, A276622, A276624, A276603 (terms divided by 2), A276604 (first differences).
Cf. A179016, A219648, A219666, A255056, A259934, A276573, A276583, A276613 for similar constructions.
Cf. also A263273.

(define (A276623 n) (A276624 (A276622 n)))

a(n) = A276624(A276622(n)).
Other identities. For all n >= 0:
A261231(a(n)) = n.
a(A261233(n)) = A024023(n) = 3^n - 1.

A276622 Simple self-inverse permutation of natural numbers: after a(0)=0, list each block of A261234(n) numbers in reverse order, from A261232(n) to A261233(1+n).

Original entry on oeis.org

0, 1, 3, 2, 8, 7, 6, 5, 4, 20, 19, 18, 17, 16, 15, 14, 13, 12, 11, 10, 9, 49, 48, 47, 46, 45, 44, 43, 42, 41, 40, 39, 38, 37, 36, 35, 34, 33, 32, 31, 30, 29, 28, 27, 26, 25, 24, 23, 22, 21, 123, 122, 121, 120, 119, 118, 117, 116, 115, 114, 113, 112, 111, 110, 109, 108, 107, 106, 105, 104, 103, 102, 101, 100, 99, 98, 97, 96

Offset: 0

Antti Karttunen, Sep 11 2016

Maps between A276623 and A276624.

Antti Karttunen, Table of n, a(n) for n = 0..6250
Index entries for sequences that are permutations of the natural numbers

Cf. A261232, A276621, A276623, A276624.

(define (A276622 n) (if (zero? n) n (+ (A261232 (+ -1 (A276621 n))) (- (A261232 (A276621 n)) n 1))))

a(0) = 0; for n >= 1, a(n) = A261232(A276621(n)-1) + A261232(A276621(n)) - n - 1.

cp's OEIS Frontend

A276623 The infinite trunk of ternary beanstalk: The only infinite sequence such that a(n-1) = a(n) - A053735(a(n)), where A053735(n) = base-3 digit sum of n.

Views

Author

Keywords

Links

Crossrefs

Programs

Scheme

Formula