A276622 -id:A276622 - 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.

A276621 After a(0)=0, each n occurs A261234(n-1) times.

Original entry on oeis.org

0, 1, 2, 2, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6

Offset: 0

Antti Karttunen, Sep 11 2016

Auxiliary function for computing A276622 & A276623.

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

Cf. A261233, A276622, A276623.

After a(0), a(n) differs from A111393(n+1) for the first time at n=46, where a(46)=5, while A111393(47)=6.

(define (A276621 n) (let loop ((k 0)) (if (>= (A261233 k) n) k (loop (+ 1 k)))))

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